Toy Parser Generator
Popularity Report
 |
|||
|
|||
|
|||
|
|||
|
|||
|
Rank
Bookmark History
Public Sticky notes
With a very clear and simple syntax, you can write an attributed grammar that is translated into a recursive descendant parser. TPG generated code is very closed to the original grammar.
Highlighted by yorkjong
The first application of TPG is TPG itself. The first (not released) version of TPG has been written by hand then was used to generate next versions. Now TPG can generate itself.
Highlighted by yorkjong
The lexical scanner uses Python regular expressions.
Highlighted by yorkjong
TPG isn't based on predictive algorithms with tables like LL(k). The main idea was instead to try every possible choices and to accept the first choice that match the input.
Highlighted by yorkjong
Public Comment