Formal parsing systems

Authors:
Sheila A. Greibach
Affiliations:
Harvard Univ., Cambridge, MA
Venue:
Communications of the ACM
Year:
1964

Citing 0
Cited 7

The role of programming in a Ph.D. computer science program

Communications of the ACM
Computational linguistics in a Ph.D. computer science program

Communications of the ACM
The predictive analyzer and a path elimination technique

Communications of the ACM
The augmented predictive analyzer for context-free languages—its relative efficiency

Communications of the ACM
An undergraduate program in computer science—preliminary recommendations

Communications of the ACM
The construction of recognizers

ACM '66 Proceedings of the 1966 21st national conference
Comments on the roots of theorems and languages both easy and hard

ACM SIGACT News

Quantified Score

Hi-index	48.30

Visualization

Abstract

Automatic syntactic analysis has recently become important for both natural language data processing and syntax-directed compilers. A formal parsing system G = (V, &mgr;, T, R) consists of two finite disjoint vocabularies, V and T, a many-many map, &mgr;, from V onto T, and a recursive set R of strings in T called syntactic sentence classes. Every program for automatic syntactic analysis determines a formal parsing system.A directed production analyzer (I, T, X, &rgr;) is a nondeterministic pushdown-store machine with internal vocabulary I, input vocabulary T, and all productions of &rgr; in the form: (Z, a) → aY1 ··· Ym, Z, Yi &egr; I, a &egr; T. Every context-free language can be analyzed by a directed production analyzer.