Access Restriction

Author Chartres, B. A. ♦ Florentin, J. J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1968
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An algorithm is described that will recognize, and fully analyze, strings of unbounded length, using the rewriting rules of any context-free grammar. It uses a finite random access store, three pushdown tapes, and a counter. It imposes no restrictions on the grammar defined by the rewriting rules, excepting only that it be a context-free phrase structure grammar. The analysis printed out is a linearized form of the structural description tree (or trees, in an ambiguous case) of the input string. A proof that the analyzer will always stop in a finite time is provided. The upper bound on the running time increases exponentially with input string length.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1968-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 15
Issue Number 3
Page Count 18
Starting Page 447
Ending Page 464

Open content in new tab

   Open content in new tab
Source: ACM Digital Library