Results 131 to 140 of about 1,597 (177)
Incorporating LR parsing into SPHINX [PDF]
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991 The 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 ...
Kenji Kita, Wayne H. Ward
openaire +2 more sources
, 2011 We explain and illustrate abstract parsing, a static-analysis technique based on abstract interpretation, LR-parsing, and partial evaluation for validating PHP-like scripts that generate HTML/XML-style documents.
Kyung-Goo Doh +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computer Languages, Systems & Structures, 2010
A language implementation with proper compositionality enables a compiler developer to divide-and-conquer the complexity of building a large language by constructing a set of smaller languages. Ideally, these small language implementations should be independent of each other such that they can be designed, implemented and debugged individually, and ...
Xiaoqing Wu +3 more
openaire +1 more source
A language implementation with proper compositionality enables a compiler developer to divide-and-conquer the complexity of building a large language by constructing a set of smaller languages. Ideally, these small language implementations should be independent of each other such that they can be designed, implemented and debugged individually, and ...
Xiaoqing Wu +3 more
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
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
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
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
LR Parsing for Conjunctive Grammars
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
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
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