On the Complexity and Performance of Parsing with Derivatives

Re:On the Complexity and Performance of Parsing with Derivat... by ThePhysicist on Saturday June 25, 2016 @05:42PM (#11978130)

Looks interesting! Have you implemented any more complex grammars with this, e.g. Python or Javascript? Would be interested to see how they perform.

Also, does it support multi-stage parsing, i.e. generation of a token tree and then a parse tree from it?

[ Parent | on HN ]

Re:On the Complexity and Performance of Parsing with Derivat... by dragostis on Sunday June 26, 2016 @01:48AM (#11979566)

There is a WIP php parser developed by the community: https://github.com/steffengy/pesty-php/blob/master/src/parse...

And, yes, it does support multi-stage parsing. After the tokens are generated, there is a process! macro which handles them. This is where you can produce an AST.

[ Parent | on HN ]