Results 101 to 110 of about 1,018 (122)
Some of the next articles are maybe not open access.
Incorporating LR parsing into SPHINX
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991The integration of an LR natural language parser with the SPHINX speech recognition system is described. LR parsing was incorporated into SPHINX to provide more global grammatical constraints. However, when using a tight grammar in a left-to-right continuous speech recognizer, when one word is missing or wrong, often several subsequent words are also ...
K. Kita, W.H. Ward
openaire +1 more source
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 +1 more source
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
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
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
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
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 +1 more source
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 +1 more source
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 +1 more source
ACM SIGPLAN Notices, 1986
LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser. A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an ...
openaire +1 more source
LR parsers can be made to run 6 to 10 times as fast as the best table-interpretive LR parsers. The resulting parse time is negligible compared to the time required by the remainder of a typical compiler containing the parser. A parsing speed of 1/2 million lines per minute on a computer similar to a VAX 11/780 was achieved, up from an ...
openaire +1 more source
Strict deterministic versus LR(0) parsing
Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73, 1973Recently strict deterministic grammars and languages have been introduced [9,10,11]. This family of languages is quite fundamental in the study of the mathematical properties of deterministic languages and in dealing with some classical families of grammars such as LR(k) and bounded right context grammars [7,8,14]. These grammars are closely related to
Matthew M. Geller, Michael A. Harrison
openaire +1 more source
The Generalized LR Parsing Algorithm
1991LR parsing is a widely used method of syntax analysis for a variety of reasons. First and foremost, an LR parser is a deterministic parser which is highly efficient: it scans the input string in one pass and is able to detect errors at an early stage.
Masaru Tomita, See-Kiong Ng
openaire +1 more source