Talk:Recursive descent parser generator

From Rosetta Code
Revision as of 06:04, 2 April 2014 by rosettacode>MagiMaster (Created page with "== Input specification == The main thing that needs to be fixed before adding any examples is the input specification. I want to make it detailed enough to be at least slightl...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Input specification

The main thing that needs to be fixed before adding any examples is the input specification. I want to make it detailed enough to be at least slightly usable (so more than just a recognizer) but I'm having trouble coming up with a clear way of expressing both the rule and the extra code generated when the rule is applied, especially taking in to account all the different languages that you might want to output with or to. Here's one attempt, but as you can see, it's not that clear:

!! start
pre-traversal code here
-> var expr
post-traversal code here

!! expr
...

Is there any way to simplify this? MagiMaster (talk) 06:04, 2 April 2014 (UTC)