Results 111 to 120 of about 323 (143)
Some of the next articles are maybe not open access.
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
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
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
Applied Mechanics and Materials, 2013
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
openaire +1 more source
This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states.
openaire +1 more source
Syntax-Error Recovery in LR-parsers
1976An efficient algorithm for error-recovery in LR-parsers is presented. The algorithm is capable of repairing all syntax errors without backtracking, in time proportional to the stack depth. It needs only a small table, a mapping from the states of the parser into the terminal symbols. The algorithm is very similiar to the parser itself. Thus, it has the
openaire +2 more sources
1971
A parsing method is described based upon Knuth's LR(k) method of analysis. It provides greater generality and earlier detection of syntax errors than other formal methods used in compilers. Many space and time optimisations are available some of which are examined in detail.
Anderson T, Eve J, Horning JJ
openaire +1 more source
A parsing method is described based upon Knuth's LR(k) method of analysis. It provides greater generality and earlier detection of syntax errors than other formal methods used in compilers. Many space and time optimisations are available some of which are examined in detail.
Anderson T, Eve J, Horning JJ
openaire +1 more source
ACM SIGPLAN Notices, 1986
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
The general trend in the development of parser theory is in the direction of exploring implementing methods of increasing power. In particular, ways of improving the efficiency of LR parsers and the generation of LR tables have been receiving a lot of attention.
openaire +1 more source
Improved error recovery in generated LR parsers
Informatica (Slovenia), 2004Summary: A new method for error recovery in LR parsers is described. An error recovery routine based on this new method can be generated automatically by a parser generator as a part of an LR parser. Based on the result that a viable suffix from which the unread part of the input is derived can be computed in certain states of an LR parser, the new ...
Slivnik, Boštjan, Vilfan, Boštjan
openaire +3 more sources
LR Parsers: A Comprehensive Review
Compiler development, which is a fundamental pillar of computer science, seeks to crystalize the interweaving of computer languages and systems. The compiler is a software that changes the source code written in high-level programming language into machine code by using six subsequent steps.Aira Udaybhasker +3 more
openaire +1 more source
Visual Exploration of Visual Parser Execution
Multimedia Tools and Applications, 2022Mattia De Rosa +2 more
exaly

