Results 141 to 150 of about 1,597 (177)
Some of the next articles are maybe not open access.
Even faster generalized LR parsing
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Aycock +3 more
openaire +2 more sources
Parsing extended LR(k) grammars
Acta Informatica, 1981An 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)
Paul Walton Purdom Jr., Cynthia A. Brown
openaire +2 more sources
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
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
Practical error recovery in LR parsing
Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82, 1982An automatic syntax error handling technique applicable to LR parsing is presented and analyzed. The technique includes a "phrase-level" error recovery strategy augmented with certain additional features such as "local correction". Attention has also been paid to diagnostic aspects, i.e. the automatic generation of error message texts.
Seppo Sippu, Eljas Soisalon-Soininen
openaire +1 more source
Generalized LR Parsing for Grammars with Contexts
2015The Generalized LR parsing algorithm for context-free grammars is notable for having a decent worst-case running time (cubic in the length of the input string), as well as much better performance on “good” grammars. This paper extends the Generalized LR algorithm to the case of “grammars with left contexts” (M. Barash, A.
Mikhail Barash, Alexander Okhotin
openaire +1 more source
LR Parsing for Boolean Grammars
2005The generalized LR parsing algorithm for context-free grammars, invented by Tomita in 1986, is extended for the case of Boolean grammars, which are a recently introduced generalization of context-free grammars with logical connectives added to the formalism of rules.
openaire +1 more source
1997
Generalized LR parsing has become popular in the second half of the 1980s, after the publication of Tomita’s algorithm [Tomita, 1985]. The theoretical foundation of this approach is in fact much older and dates back to Lang [1974].
openaire +1 more source
Generalized LR parsing has become popular in the second half of the 1980s, after the publication of Tomita’s algorithm [Tomita, 1985]. The theoretical foundation of this approach is in fact much older and dates back to Lang [1974].
openaire +1 more source
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
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
GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
International Journal of Foundations of Computer Science, 2006The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which ...
openaire +2 more sources