By the way, there's no need to implement a separate tokenizer process to implement this in Scheme.
I intend to implement the Scheme version in a way that quietly does it "at the same time", making the actual implementation really easy. In fact, although it's not obvious, the BNF is specifically "rigged" to be especially easy to implement using recursive descent. INDENT and DEDENT can be determined by just comparing the indent strings. The head/rest productions actually end up looking a lot like a tokenizer, but without needing a separate tokenizer. I had to use "modes" in ANTLR because the parser cannot communicate back to the lexer; in recursive descent that's a non-problem. --- David A. Wheeler ------------------------------------------------------------------------------ Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current with LearnDevNow - 3,200 step-by-step video tutorials by Microsoft MVPs and experts. ON SALE this month only -- learn more at: http://p.sf.net/sfu/learnnow-d2d _______________________________________________ Readable-discuss mailing list Readable-discuss@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/readable-discuss
