Abstract
Left context precendence grammars which are defined in this paper are a proper subclass of the precedence grammars and contain properly the simple precedence grammars. Left context precedence grammars need not be uniquely invertible. The parsing algorithm developed for left context precedence languages works with linear time and has the viable prefix property which is a stronger property than the correct prefix property.
Full Text
Published Version
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 call