Results 111 to 120 of about 298 (140)

Practical Error Recovery for LR Parsers

1977
Abstract : A 'forward move algorithm' and some of its formal properties are presented for use in a practical syntactic error recovery scheme for LR parsers. The algorithm finds a 'valid fragment' (comparable to a valid prefix) just to the right of a point of error detection.
Frank DeRemer, Thomas J. Pennello
openaire   +1 more source

Eliminating unit productions from LR parsers

Acta Informatica, 1977
In this paper we show how one can improve upon an algorithm by Aho and Ullman [3] for eliminating unit productions from an LR(k) parser so that the elimination concerned can be made in all cases, instead of only in the special case required by [3] where no two unit productions have the same left-hand side.
openaire   +1 more source

Construction of efficient generalized LR parsers

1998
We 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, David Cabrero, Manuel Vilares   +2 more
openaire   +1 more source

An LR Parser with Less States

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

Efficient full LR(I) parser generation

ACM SIGPLAN Notices, 1988
This paper proposes that full LR(1) parser generators are easier to use than the LALR(1) parser generators commonly in use, and that minimal-state full LR(1) tables are not much larger than LALR(1) tables. A method is presented for the automatic construction of minimal-state full LR(1) parser tables.
openaire   +1 more source

Shift-reduce conflicts in LR parsers

ACM SIGPLAN Notices, 1989
In 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

Improved error recovery in generated LR parsers

2004
Summary: 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

A Generalized Earley Parser for Human Activity Parsing and Prediction

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021
Siyuan Qi, Baoxiong Jia, Siyuan Huang
exaly  

Syntax-Error Recovery in LR-parsers

1976
An 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

P4-to-blockchain: A secure blockchain-enabled packet parser for software defined networking

Computers and Security, 2020
Abbas Yazdinejad, Reza M Parizi, Ali Dehghantanha   +2 more
exaly