Recursive descent parsing for grammars with contexts
Recursive descent parsing for grammars with contexts
Recursive descent parsing for grammars with contexts
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Results<strong>Recursive</strong> <strong>descent</strong> parser:Theory:conjunction in rules: scan the substring multiple timesright <strong>contexts</strong> (✄, ): to choose suitable alternatives of rulesbacktracking: to go over the alternativesmemoization: linear time instead of exponentialmathematically sound definition of right <strong>contexts</strong>(“look-ahead”) <strong>with</strong>in recursive <strong>descent</strong>Practice:higher expressive power, but still linear time<strong>parsing</strong> algorithm proven correctimplemented as a prototype softwareMikhail Barash<strong>Recursive</strong> <strong>descent</strong> <strong>for</strong> <strong>grammars</strong> <strong>with</strong> <strong>contexts</strong>