Results 101 to 110 of about 306 (143)
Some of the next articles are maybe not open access.
Acta Informatica, 1978
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to ...
openaire +3 more sources
Embedding semantics in LR parser tables
Software: Practice and Experience, 1978AbstractThis paper addresses two of the problems commonly associated with LR parsing and syntax directed translation schemes, namely grammar stratification and excessively large table size, A solution is discussed which can eliminate stratification of the grammar by allowing the designer to embed semantics directly within the LR table (i.e., at shift ...
Will D. Gillett, Sandra Leach
openaire +2 more sources
Automatic error recovery for LR parsers
Communications of the ACM, 1978In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser.
M. Dennis Mickunas, John A. Modry
openaire +1 more source
Incremental generation of LR parsers
Computer Languages, 1990Abstract Implementation of a new compiler usually requires making frequent adjustments to grammar definitions. An incremental technique for updating the parser tables after a monor change to the grammer could potentially save much computational effort.
openaire +1 more source
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
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