Results 81 to 90 of about 75,315 (101)
Some of the next articles are maybe not open access.
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
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 ...
Harold W. Lawson, David R. Doucette
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
A Top-Down Model for Character-Level Chinese Dependency Parsing [PDF]
This paper proposes a novel transition-based algorithm for character-level Chinese dependency parsing that straightforwardly models the dependency tree in a top-down manner. Based on the stack-pointer parser, we joint Chinese word segmentation, part-of-speech tagging, and dependency parsing in a new way.
Yufeng Chen+4 more
openaire +1 more source
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
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 ...
Mark Minas+2 more
openaire +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
Top-Down Parsing Error Correction Applied to Part of Speech Tagging
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 English texts, the same cannot be said for every language.
Alexandre B. Pigozzo+2 more
openaire +2 more sources
A top-down no backtrack parsing of general context-free languages
1977A new parsing algorithm is presented. The algorithm works in a top-down manner and it is easily implementable. The algorithm works for all non left-recursive e-free context-free grammars. For LR(1) left-recursion-free grammars works like an LR(1) push-down acceptor.
openaire +2 more sources
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
2007The paper extends the notion of context-free LL(k) grammars to CD grammar systems using two different derivation modes, examines some of the properties of the resulting language families, and studies the possibility of parsing these languages deterministically, without backtracking.
György Vaszil, Henning Bordihn
openaire +2 more sources