Results 181 to 190 of about 163,441 (217)

Construction and Implementation of LR(1) Parsers

1990
This chapter is devoted to the practical issues involved in the construction and use of deterministic LR(1) parsers. We shall show how the practical versions of LR (1) parsers, most notably the LALR (1) parsers, can be constructed efficiently, and we shall present methods for encoding LR(1) parsers as efficient RAM programs. Two versions of RAM program
Eljas Soisalon-Soininen, Seppo Sippu
openaire   +2 more sources

Upper bounds on the size of LR(k) parsers

Information Processing Letters, 1985
The size of an LR(k) parser essentially depends on the number of different LR(k) tables or states of the parser which is always bounded by y \(2^{| G|^{k+1}}\). However, it appears to be rather difficult to prove that this or any other double exponential upper bound is strict.
openaire   +3 more sources

An alternative approach to the improvement of LR(k) parsers

Acta Informatica, 1976
The methods of improving LR(k) parsers proposed by DeRemer and Korenjak are shown to be based on a single concept -- that of modifying the contextual information on which parsing decisions are made. This concept is then used to derive a straightforward algorithm for eliminating unit productions from an LR parser.
openaire   +2 more sources

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   +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

Capturing semantic features to improve Chinese event detection

CAAI Transactions on Intelligence Technology, 2022
Yongbin Liu
exaly  

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

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