Results 201 to 210 of about 163,637 (234)

Full LR(1) parser generation

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   +2 more sources

Complexity of Extended vs. Classic LR Parsers

2014
For 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.
A. Borsotti, BREVEGLIERI, LUCA ODDONE, CRESPI REGHIZZI, STEFANO, MORZENTI, ANGELO CARLO   +3 more
openaire   +2 more sources

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   +2 more sources

The SSS-LR continuous speech recognition system: integrating SSS-derived allophone models and a phoneme-context-dependent LR parser

ICSLP, 1992
Akito Nagai, J. Takami, S. Sagayama
semanticscholar   +1 more source

An Efficient LR Parser Generator for Tree Adjoining Grammars

International Workshop/Conference on Parsing Technologies, 2000
C. Prolo
semanticscholar   +1 more source

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   +2 more sources

An efficient predictive LR parser using pause information for continuously spoken sentence recognition

ICSLP, 1994
T. Takezawa, T. Morimoto
semanticscholar   +1 more source

An efficient incremental LR parser for grammars with epsilon productions

Acta Informatica, 1983
R. Agrawal, Keith D. Detro
semanticscholar   +1 more source

Speech recognition by combining pairwise discriminant time-delay neural networks and predictive LR-parser

Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop, 1991
J. Takami, A. Kai, S. Sagayama
semanticscholar   +1 more source

The LR(k) parser [PDF]

, 2005
openaire   +1 more source