Skip to content

Longest Match and Extended Pascal
Compare
Choose a tag to compare
@PhilippeSigaud PhilippeSigaud released this 02 Mar 20:14
· 132 commits to master since this release
v0.4.0
ad58513

This is Pegged version 0.4.0.

  • This new minor release introduces a longest-match alternation operator, |, which will always choose the longest match during a parse. See https://github.com/PhilippeSigaud/Pegged/wiki/Extended-PEG-Syntax for more details and the interest of this operator for grammar writers.
  • The left-recursion engine, introduced in version v0.3.0 is now fully documented in the wiki at https://github.com/PhilippeSigaud/Pegged/wiki/Left-Recursion. Pegged can deal with left recursion, hidden left recursion and indirect left recursion. Try it!
  • These improvements allow Pegged to generate a parser that fully parses Extended Pascal files, based on the official ISO 10206:1990 grammar. Have a look at it in the pegged/examples/extended_pascal directory.

Thanks a lot for Bastiaan Veelo for these wonderful improvements to Pegged!

Assets 2
Loading