Results 131 to 140 of about 141,588 (171)
Some of the next articles are maybe not open access.
Suffix languages in Lr parsing
International Journal of Computer Mathematics, 1995For 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. +1 more
openaire +2 more sources
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.
David T. Barnard, James R. Cordy
openaire +1 more source
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.
David T. Barnard, James R. Cordy
openaire +1 more source
LL parsing, LR parsing, complexity, and automata
ACM SIGCSE Bulletin, 2002It is well known that pushdown-stack automata find application within the syntactic analysis phase of compilation. Nonetheless, in most compiler design textbooks the relation between popular parsing algorithms and the theory of deterministic pushdown-stack automata remains implicit.
openaire +2 more sources
Acta Informatica, 1983
The principal tools in LR theory, viz. item grammars and their corresponding automata, are adapted for use with affix grammars. The items (and automata states) are furnished with attributes that serve as pointers into the parsing stack and thus determine the inherited affixes needed in a reduction step.
openaire +2 more sources
The principal tools in LR theory, viz. item grammars and their corresponding automata, are adapted for use with affix grammars. The items (and automata states) are furnished with attributes that serve as pointers into the parsing stack and thus determine the inherited affixes needed in a reduction step.
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 +3 more sources
Even faster generalized LR parsing
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Aycock +3 more
openaire +3 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 +2 more sources
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 +2 more sources
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 +2 more sources