Results 151 to 160 of about 636 (187)
Some of the next articles are maybe not open access.
Generation of LR parsers by partial evaluation
ACM Transactions on Programming Languages and Systems, 2000The combination of modern programming languages and partial evaluation yields new approaches to old problems. In particular, the combination of functional programming and partial evaluation can turn a general parser into a parser generator.
Michael Sperber, Peter Thiemann 0001
openaire +2 more sources
LR(0) grammars generated by LR(0) parsers
Acta Informatica, 1981Let ? be an LR(0) parser of a given LR(0) grammar G. Generally, ? does not only parse the words generated by G but also the words of some other LR(0) grammars different from G. In this paper we shall define a class of LR(0) parsers and shall present a characterization and a method for the construction of all LR(0) grammars which can be parsed by a ...
openaire +1 more source
Comparison of syntactic error handling in LR parsers
Software: Practice and Experience, 1995AbstractError recovery techniques for LR parsers presented in the literature are described and classified. The techniques considered range from the non‐correcting ones to interactive and incremental ones. Also, some of the techniques presented are compared and evaluated.
DEGANO, PIERPAOLO, Priami C.
openaire +3 more sources
ACM SIGPLAN Notices, 1981
Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
openaire +1 more source
Full LR(1) parser generation is discussed and shown to be useful and practical, in contrast to current widespread misconception.
openaire +1 more source
On a method for optimizing LR parsers
International Journal of Computer Mathematics, 1979It is shown that if the basic method for eliminating single productions from canonical LR parsers developed by Pager is applied to an SLR parser and the resulting parser is free of conflicts, then the resulting parser is a valid parser which accepts exactly the strings in the language.
Kai Koskimies, Eljas Soisalon-Soininen
openaire +1 more source
Shift-reduce conflicts in LR parsers
ACM SIGPLAN Notices, 1989In this note, the shift-reduce conflicts of LR(1) and LR(0) are compared. It is concluded that, if LR(1) has no shift-reduce conflicts, or, if the LR(1) shift-reduce conflicts are resolved in favor of the shift, then all shift-reduce conflicts of the corresponding LR(0) can be correctly resolved by the simple rule: resolve in favor of the shift.
openaire +1 more source
An LR Substring Parser Applied in a Parallel Environment
Journal of Parallel and Distributed Computing, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gwen Clarke, David T. Barnard
openaire +2 more sources
Construction of efficient generalized LR parsers
1998We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n3) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of ...
Miguel A. Alonso 0001 +2 more
openaire +1 more source
A technique for speeding up LR(k) parsers
Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72, 1972We present a new transformation that reduces the size and increases the speed of LR(k) parsers. This transformation can be applied to all LR(k) parsers including those produced by Knuth's and DeRemer's techniques. The transformation causes the parser to avoid reductions by productions of the form A → B where A and B are non-terminals.
Alfred V. Aho, Jeffrey D. Ullman
openaire +1 more source
Complexity of Extended vs. Classic LR Parsers
2014For the deterministic context-free languages, we compare the space and time complexity of their LR (1) parsers, constructed in two different ways: the classic method by Knuth [7] for BNF grammars, and the recent one by the authors [2], which directly builds the parser from EBNF grammars represented as transition networks.
Angelo Borsotti +3 more
openaire +1 more source