parser-generator

How can the negation meta-character, ~ , be used in ANTLR's lexer- and parser rules? Bart Kiers Negating can occur inside lexer and parser rules . Inside lexer rules you can negate characters, and inside parser rules you can negate tokens (lexer rules). But both lexer- and parser rules can only negate either single characters, or single tokens, respectively. A couple of examples: lexer rules To match one or more characters except lowercase ascii letters, you can do: NO_LOWERCASE : ~('a'..'z')+ ; (the negation-meta-char, ~ , has a higher precedence than the + , so the rule above equals (~('a'..

I'm looking for a parser generator that given an EBNF for a LL(k) language will give me a C# parser and generate classes the types defined in the EBNF. plinth Gold is OK as far a parser generators go. ANTLR (nothing else to say) You might want to look at MinosseCC , a port of JavaCC to C#. Another possibility is Spart . Find Irony in http://irony.codeplex.com/ PROS: It is simple CONS: -Lack of document -Rather Slow There is a new parser generator on the block called LLLPG , that supports LL(k) grammars and zero-width assertions. It can be used without a runtime library (a base class suffices).