Abstract
AN EXTENSION of Knuth's algorithm for parsing context-free languages is considered. The algorithm proposed is not a left-sided parsing algorithm. It is shown how, by slightly changing the grammar, it is in many cases possible to attain unique parsing by means of an extension of Knuth's algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: USSR Computational Mathematics and Mathematical Physics
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.