BibTeX
@MISC{Leermakers89howto,
author = {René Leermakers},
title = {How to Cover a Grammar},
year = {1989}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper. On the one hand, non-deterministic LR-parsing comes down to the use of certain covers for the grammar at hand, just like the Earley algorithm. Reversely, we showed that the Earley cover can, with minor modifications, be obtained from the LL/LIt-automaton, which also uses precom- puted sets of items
Citations
| 594 | An efficient context-free parsing algorithm - Earley - 1970 |
| 182 | Efficient Parsing for Natural Language - Tomita - 1986 |
| 126 | The Theory of Parsing, Translation, and Compiling - Aho, Ullman - 1972 |
| 78 | Deterministic techniques for efficient non-deterministic parsers - Lang - 1974 |
| 76 | An improved context-free recognizer - Graham, Harrison, et al. - 1980 |
| 2 | A new approach to Earley's parsing algorithm, Science of Computer Programming volume 12 - Aretz, J - 1989 |
