Results 111 to 120 of about 84,961 (134)
Some of the next articles are maybe not open access.

Run-time Extensible Deterministic Top-Down Parsing*

Grammars, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Žemlička, Michal, Král, Jaroslav
openaire   +2 more sources

Top-down-Parsing

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   +1 more source

Top-Down Parsing

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.
Alan Bundy, Lincoln Wallen
openaire   +1 more source

Producing a top-down parse order with bottom-up parsing

Information Processing Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schmeiser, James P., Barnard, David T.
openaire   +1 more source

Top-Down Parsing of Conjunctive Languages

Grammars, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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, 2003
The 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.
Y. Chu, K. Itano
openaire   +1 more source

A translation machine with automated top-down parsing

ACM SIGPLAN Notices, 1976
The top-down method of parsing programming languages has been widely used in commercially available compilers. Suprisingly, techniques for automating syntax-directed, top-down parsing have not been <u>widely</u> available. This paper describes a practical top-down parsing method which is a part of a general purpose <u>translation ...
Harold W. Lawson, David R. Doucette
openaire   +1 more source

Top Down Parsing of Macro Grammars

1976
Recursive 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 ...
Heydthausen, M., Mehlhorn, K.
openaire   +2 more sources

Top-down parsing in Coco-2

ACM SIGPLAN Notices, 1991
Coco-2 [Dobler90] is a new compiler compiler with two interesting features: It allows the specification of the lexical structure, syntax and semantics of a source language within a single document and it implements a new top-down parsing method.
openaire   +1 more source

Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars

2021
Contextual hyperedge replacement (CHR) strengthens the generative power of hyperedge replacement (HR) significantly, thus increasing its usefulness for practical modeling. We define top-down parsing for CHR grammars by graph transformation, and prove that it is correct as long as the generation and use of context nodes in productions does not create ...
Frank Drewes   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy