Results 91 to 100 of about 1,018 (122)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Acta Informatica, 2011
To improve the readability of a grammar it is common to use extended context free grammars (ECFGs) which are context free grammars (CFGs) extended with the repetition operator (*), the alternation operator (¦) and parentheses to express the right hand sides of the productions. The topic treated here is LR-parsing of ECFGs.
Kyung-Goo Doh +2 more
openaire +3 more sources
To improve the readability of a grammar it is common to use extended context free grammars (ECFGs) which are context free grammars (CFGs) extended with the repetition operator (*), the alternation operator (¦) and parentheses to express the right hand sides of the productions. The topic treated here is LR-parsing of ECFGs.
Kyung-Goo Doh +2 more
openaire +3 more sources
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
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
Parallel incremental LR parsing
Computer Languages, 1994A 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
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
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
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)
Purdom, Paul Walton jun. +1 more
openaire +2 more sources
LR Parsing for Conjunctive Grammars
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Even faster generalized LR parsing
Acta Informatica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aycock, John +3 more
openaire +2 more sources