Thumbnail
Access Restriction
Subscribed

Author Mickunas, M. Dennis
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A direct, one-step transformation is presented for transforming an arbitrary $\textit{LR}(\textit{k})$ context-free grammar, $\textit{G},$ to an $\textit{LR}(1)$ grammar, $\textit{G}′,$ which completely covers $\textit{G}.$ Under additional hypotheses, $\textit{G}′$ may be made $\textit{LR}(0).$
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 1976-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 1
Page Count 14
Starting Page 17
Ending Page 30


Open content in new tab

   Open content in new tab
Source: ACM Digital Library