Abstract
LL(1) grammars play an important role in top-down parsing. In order to improve their efficiency, this paper presents a new type of grammar, Sub-LL(1), based on LL(1), and shows that there is a grammar which is Sub-LL(1) and not LL(1) though LL(1)- and Sub-LL(1)-languages are identical.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: International Journal of Computer & Information Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
