Hi David, Thank you for the generous help :) As far as I can see, Lex and Yacc do the same thing on different abstraction layer. That is, Lex rule is regular expression of character, while Yacc rule (if we use EBNF) is regular expression of token. The only difference is Yacc rule embrace recursion. I guess Lex parser is only a special case of Yacc parser (Lex output is list but not recursively structure like tree). So why not merge them into one tool?
Best regards, Davy On Aug 20, 11:49 pm, David Beazley <[EMAIL PROTECTED]> wrote: > I'm not aware of any tool like this off the top of my head. > However, in terms of support EBNF in PLY, I have a feeling that it > would be easier to support EBNF using some kind of tool or wrapper > that creates a standard BNF for PLY to work with. Modifying the > table generation code in PLY to use an EBNF directly would likely > fall somewhere in the middle of the "hairy" category of projects. Of > course, I could be wrong, but that's just my gut feeling about it. > > Cheers, > Dave > > On Aug 20, 2008, at 9:36 AM, Davy wrote: > > > > > > > Hi, > > > I am using PLY these days and found BNF hard to write. Is there any > > EBNF support in PLY? Or Is there any tool to convert EBNF to BNF for > > Yacc? > > > Best regards, > > Davy- Hide quoted text - > > - Show quoted text - --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "ply-hack" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/ply-hack?hl=en -~----------~----~----~----~------~----~------~--~---
