Results 231 to 240 of about 228,482 (264)
, 2007 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Producing a top-down parse order with bottom-up parsing
Information Processing Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James P. Schmeiser, David T. Barnard
openaire +2 more sources
1994
Wir entwickeln in diesem Kapitel zunachst ein Schema zur Top-down-Analyse von Satzen, das wir anschliesend schrittweise zu einem Erkennungs- und einem Parsingalgorithmus erweitern. Dabei wird gezeigt, wie bei einer Top-down-Analyse entweder die Depth-first-Suche mit Backtracking oder die Breadth-first-Suche verwendet werden kann.
Sven Naumann, Hagen Langer
openaire +2 more sources
Wir entwickeln in diesem Kapitel zunachst ein Schema zur Top-down-Analyse von Satzen, das wir anschliesend schrittweise zu einem Erkennungs- und einem Parsingalgorithmus erweitern. Dabei wird gezeigt, wie bei einer Top-down-Analyse entweder die Depth-first-Suche mit Backtracking oder die Breadth-first-Suche verwendet werden kann.
Sven Naumann, Hagen Langer
openaire +2 more sources
A top-down parsing co-processor for compilation
[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track, 2003The architecture of a top-down parsing coprocessor is presented. This processor aims at fast compilation for programming languages in LL(1) grammar. It accepts a stream of tokens from the lexical coprocessor and produces a stream of codes representing semantic action to be taken by the CPU.
K. Itano, Y. Chu
openaire +2 more sources
1984
In trying to parse a string with a grammar, if one starts with the grammar and tries to fit it to the string, this is top-down parsing. For instance with a context-free grammar . one starts with expansions for the initial symbol, and builds down from there trying to find an expansion which will get to the symbols in the string.
Lincoln Wallen, Alan Bundy
openaire +2 more sources
In trying to parse a string with a grammar, if one starts with the grammar and tries to fit it to the string, this is top-down parsing. For instance with a context-free grammar . one starts with expansions for the initial symbol, and builds down from there trying to find an expansion which will get to the symbols in the string.
Lincoln Wallen, Alan Bundy
openaire +2 more sources
Top Down Parsing of Macro Grammars
1976Recursive descent is for its ease of description and for its transparency one of the popular parsing methods [Gries, Knuth]. The class of languages, for which recursive descent works as a parsing method, is known as the LL-languages; their properties were studied by Lewis & Stearns, Rosenkranz & Stearns and many others (see [Aho & Ullman] for complete ...
Kurt Mehlhorn +2 more
openaire +2 more sources
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
International Conference on Graph Transformation, 2021F. Drewes, Berthold Hoffmann, M. Minas
semanticscholar +1 more source
Memory Resource Allocation in Top-Down Minimalist Parsing
2013This paper provides a linking theory between the minimalist grammar formalism and off-line behavioural data. We examine the transient stack states of a top-down parser for Minimalist Grammars as it analyzes embedded sentences in English, Dutch and German.
John Hale +2 more
openaire +2 more sources
Journal of Computational Science and Technology, 2023
Longyin Zhang +4 more
semanticscholar +1 more source
Longyin Zhang +4 more
semanticscholar +1 more source