Abstract
A new parsing algorithm is presented. The algorithm works in a top-down manner and it is easily implementable. The algorithm works for all non left-recursive ε-free context-free grammars. For LR(1) left-recursion-free grammars works like an LR(1) push-down acceptor. The time bounds are O(n3) for all context-free grammars, O(n2) for a superset of unambiguous grammars and O(n) for a superset of LR grammars (see Graham, Harrison [1]). It is hoped that the ideas used in the algorithm can help to find an accepting algorithm working in time O(n2). The method has promising properties for error recovery in compilers and produces all the possible parses in a string encoding. In any case, the ideas presented in the paper can contribute to the understanding of the parsing problem of general context-free languages.KeywordsError RecoveryInput StringAnalysis PictureSyntax AnalysisInitial SymbolThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
