Parsing expression grammar: Difference between revisions

Revision as of 09:43, 16 May 2024

Revision as of 07:17, 11 July 2024

Line 187:

|class=cs.PL

| eprint = 2005.06444

}}</ref> uses dynamic programming to apply PEG rules bottom-up and right to left, which is the inverse of the normal recursive descent order of top-down, left to right. Parsing in reverse order solves the left recursion problem, allowing left-recursive rules to be used directly in the grammar without being rewritten into non-left-recursive form, and also conveysconfers optimal error recovery capabilities upon the parser, which historically proved difficult to achieve for recursive descent parsers.

== Advantages ==