Access Restriction

Author Greibach, Sheila A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Automatic syntactic analysis has recently become important for both natural language data processing and syntax-directed compilers. A formal parsing system G = (V, μ, T, R) consists of two finite disjoint vocabularies, V and T, a many-many map, μ, 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 ε I, a ε T. Every context-free language can be analyzed by a directed production analyzer.
Description Affiliation: Harvard Univ., Cambridge, MA (Greibach, Sheila A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 7
Issue Number 8
Page Count 6
Starting Page 499
Ending Page 504

Open content in new tab

   Open content in new tab
Source: ACM Digital Library