Proceedings ArticleDOI
Deterministic left corner parsing
Daniel J. Rosenkrantz,P. M. Lewis +1 more
- pp 139-152
Reads0
Chats0
TLDR
In this article, a subset of LC(k) grammars, called strong LC (k) grammar, is defined and shown to be exactly those grammarmars for which a certain canonical pushdown machine that does left corner parsing is deterministic.Abstract:
Left corner parsing refers to a class of parsing procedures in which the productions are recognized in a particular order which is different than both bottom up and top down. Each production is recognized after its left descendant but before its other descendants. Procedures in this class have occurred frequently in the compiler literature. In this paper a class of grammars, called LC (k) grammars, is defined and shown to be exactly those grammars for which a certain canonical pushdown machine that does left corner parsing is deterministic. A subset of LC(k) grammars, called strong LC(k) grammars, is defined and shown to be those grammars that can be deterministically left corner parsed by a simplified canonical machine. It is shown that when a particular grammatical rewriting procedure is applied to a grammar, the resulting grammar is (strong) LL(k) if and only if the original grammar is (strong) LC(k). This implies that the class of LC(k) languages is identical to the class of LL(k) languages. The syntax directed translations on LC(k) grammars that can be performed by the canonical pushdown machine are also discussed.read more
Citations
More filters
Book
Parsing Techniques: A Practical Guide
Dick Grune,Ceriel J. H. Jacobs +1 more
TL;DR: This second edition of Grune and Jacobs brilliant work presents new developments and discoveries that have been made in the field of parsing, also referred to as syntax analysis, and is used extensively in linguistics.
Journal ArticleDOI
Probabilistic top-down parsing and language modeling
TL;DR: The authors proposed a probabilistic top-down parser for language modeling for speech recognition, which performs very well in terms of both the accuracy of returned parses and the efficiency with which they are found, relative to the best broad-coverage statistical parsers.
Posted Content
Probabilistic top-down parsing and language modeling
TL;DR: A lexicalized probabilistic top-down parser is presented, which performs very well, in terms of both the accuracy of returned parses and the efficiency with which they are found, relative to the best broad-coverage statistical parsers.
Journal ArticleDOI
Spoken Language Derived Measures for Detecting Mild Cognitive Impairment
TL;DR: The results indicate that using multiple, complementary measures can aid in automatic detection of MCI, and demonstrate a statistically significant improvement in the area under the ROC curve (AUC) when using automatic spoken language derived features in addition to the neuropsychological test scores.
Proceedings ArticleDOI
Discriminative Training of a Neural Network Statistical Parser
TL;DR: It is shown how a parser can be trained with a discriminative learning method while still parameterizing the problem according to a generative probability model, resulting in state-of-the-art levels of performance.
References
More filters
Journal ArticleDOI
On the translation of languages from left to right
TL;DR: LR(k) grammars are defined, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of parsing algorithms for languages with simple structure, e.g. algebraic languages.
Journal ArticleDOI
Syntax-Directed Transduction
TL;DR: Some special conditions are investigated under which syntax-directed translations can be performed on (deterministic) pushdown machines and some time bounds for translations on Turing machines are derived.
Journal ArticleDOI
Properties of deterministic top-down grammars
TL;DR: The class of context-free grammars that can be deterministically parsed in a top down manner with a fixed amount of look-ahead is investigated and it is shown that the equivalence problem is decidable for LL(k) Grammars.
Book ChapterDOI
Matrix Equations and Normal Forms for Context-Free Grammars
TL;DR: In this article, the relationship between the set of productions of a context-free grammar and the corresponding set of defining equations is pointed out, and the closure operation on a matrix of strings is defined and used to formalize the solution to a set of linear equations.
Journal ArticleDOI
Matrix Equations and Normal Forms for Context-Free Grammars
TL;DR: The relationship between the set of productions of a context-free grammar and the corresponding set of defining equations is pointed out and the closure operation on a matrix of strings is defined.