Results 111 to 120 of about 306 (143)
Some of the next articles are maybe not open access.
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
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
An LR parser with pre-determined reduction goals
Information Processing Letters, 1999전산학과
Lee, GO, Choe, KM Choe, Kwang-Moo
openaire +2 more sources
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 +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 +2 more sources
The Design of a Dynamic Configurable Packet Parser Based on FPGA
Micromachines, 2023Zhichuan Guo, Ying Sun
exaly