Thumbnail
Access Restriction
Subscribed

Author Hibbard, Thomas N.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A phrase structure grammar is called $\textit{context-limited}$ if there exists a partial ordering on its alphabet such that any letter on the left of any production is less than some letter on the right of the same production. It is proved that context-limited grammars are equivalent to context-free grammars, the equivalence including ambiguity. The notion of ambiguity in phrase structure grammars is discussed, and a new formal model for ambiguity, based on directed plane graphs with labeled edges, is outlined and compared with other models.
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 1974-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 3
Page Count 8
Starting Page 446
Ending Page 453


Open content in new tab

   Open content in new tab
Source: ACM Digital Library