Results 231 to 240 of about 236,582 (260)
Some of the next articles are maybe not open access.
Top-Down Parsing of Conjunctive Languages
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Okhotin
semanticscholar +2 more sources
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
International Conference on Graph Transformation, 2021Contextual 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 ...
F. Drewes, Berthold Hoffmann, M. Minas
semanticscholar +2 more sources
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
International Conference on Graph Transformation, 2015Graph languages defined by hyperedge replacement grammars can be NP-complete. We invent predictive top-down (PTD) parsers for a subclass of these grammars, similar to recursive descent parsers for string languages. The focus of this paper lies on the grammar analysis that computes neighbor edges of nonterminals, in analogy to the first and follow ...
F. Drewes, Berthold Hoffmann, M. Minas
semanticscholar +2 more sources
Run-time Extensible Deterministic Top-Down Parsing*
Grammars, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Zemlicka, J. Král
semanticscholar +3 more sources
Top-Down Parsing Error Correction Applied to Part of Speech Tagging
Communication Systems and Applications, 2020Natural Language Processing (NLP) applications are growing in popularity and importance, all of these applications rely upon the basic steps of tokenization, stemming and Part-of-Speech tagging (POS), and while those steps already work really well on ...
Ygor Henrique de Paula Barros Baêta +2 more
semanticscholar +2 more sources
A translation machine with automated top-down parsing
ACM SIGPLAN Notices, 1976The 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 ...
H. Lawson, David R. Doucette
semanticscholar +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, 1989The 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
semanticscholar +2 more sources
Coarse classification using a hierarchical decision tree and top down parsing
ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing, 1986In this paper, we describe a robust technique for segmenting an utterance into a sequence of coarse phonetic classes. The resulting coarse class string is used to provide contextual information for further phonetic analysis, and in lexical access to limit the number of word candidates.
L. Wilcox, B. Lowerre
semanticscholar +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 +1 more source
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
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
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