Abstract
A top-down parsing scheme for macro grammars is proposed. It extends the recursive descent method frequently used in context-free parsing. It is shown to be decidable if a macro grammar is top-down parsable. Nearly matching lower and upper bounds for the complexity of the decision procedure are derived. A time and space efficient recognition algorithm is described.
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 callDisclaimer: 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.
