Results 131 to 140 of about 192,464 (184)

Increasing the Applicability of LR Parsing

International Workshop/Conference on Parsing Technologies, 1993
M. Nederhof, J. Sarbo
semanticscholar   +2 more sources

Even faster lr parsing

Software: Practice and Experience, 1990
AbstractConventional LR parser generators create tables which are used to drive a standard parser procedure. Much faster parsers can be obtained by compiling the table entries into code that is directly executed. A possible drawback with a directly executable parser is its large size.
R. Nigel Horspool, Michael Whitney
openaire   +1 more source

Parallel incremental LR parsing

Computer Languages, 1994
A new parallel parsing algorithm for block structured languages, capable of parsing incremen- tally also, is presented. The parser is for LR grammars. A shared memory multiprocessor model is assumed. We associate processors to parse corrections independently with minimum reparsing.
Viswanathan, N, Srikant, YN
openaire   +1 more source

Skeletal LR parsing

15th Annual Symposium on Switching and Automata Theory (swat 1974), 1974
Recent work [AJU, E1, E2] has shown that substantial improvements in both the size and the running time of a bottom-up parser often can be realized by constructing the parser using an ambiquous underlying grammar. Various heuristic techniques are used to resolve action conflicts in the parser which result from the ambiquity of the grammar.
openaire   +1 more source

LR(k) Parsing

1990
In this chapter we shall generalize the notion of strong LL(k) parsing presented in Chapter 5 and consider a method for deterministic left parsing that applies to a slightly wider class of context-free grammars than does the strong LL(k) parsing method. This method will be called “canonical LL(k) parsing”. As in strong LL(k) parsing, the acronym “LL(k)”
Seppo Sippu, Eljas Soisalon-Soininen
openaire   +1 more source

Parsing extended LR(k) grammars

Acta Informatica, 1981
An extended LR(k) (ELR(k)) grammar is a context free grammar in which the right sides of the productions are regular expressions and which can be parsed from left to right with k symbol look-ahead. We present a practical algorithm for producing small fast parsers directly from certain ELR(k) grammars, and an algorithm for converting the remaining ELR(k)
Purdom, Paul Walton jun., Brown, Cynthia A.   +1 more
openaire   +2 more sources

Suffix languages in Lr parsing

International Journal of Computer Mathematics, 1995
For each state in the LR(0) automaton of a context-free grammar, there exists a language consisting of the valid strings that might be parsed from that state. Existing techniques for adding lookahead to an LR(0) automaton do not explicitly consider these “suffix” languages. Instead, existing techniques examine prefixes of suffix languages or some other
Seyfarth, Benjamin R., Bermudez, Manuel E.   +1 more
openaire   +1 more source

SL parses the LR languages

Computer Languages, 1988
SL ist die Syntaxkomponente der Syntax/Semantik-Sprache S/SL. Diese ist entwickelt für die Implementierung von Compilern in top-down-Verfahren und enthält keine Daten oder Zuweisungen. Daten werden nur über semantische Operationen gesteuert. Für verschiedene Sprachen ist sie bei der Erstellung von Parsern benutzt worden, so z.B.
Barnard, David T., Cordy, James R.
openaire   +1 more source

A text-based syntax completion method using LR parsing and its evaluation

Science of Computer Programming, 2023
Isao Sasano, Kwanghoon Choi
semanticscholar   +1 more source

LR and LL parsing

ACM SIGCSE Bulletin, 2000
The two best known parsing algorithms are LR and LL parsing respectively. These algorithms are explained extensively in the vast literature on compiler construction and formal language theory. In almost any textbook, LR and LL are regarded as two distinct methods.
openaire   +2 more sources