Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’ve worked on Flex, Bison few years ago during my undergraduate studies. However, I don’t remember much about it now. Recently, I have come to hear about ANTLR.
ANTLRv3 is LL(k), and can be configured to be LL(*). The latter in particular is ridiculously easy to write parsers in, as you can essentially use EBNF as-is.
Also, ANTLR generates code that is quite a lot like recursive descent parser you’d write from scratch. It’s very readable and easy to debug to see why the parse doesn’t work, or works wrong.
The advantage of Flex/Bison (or any other LALR parser) is that it’s faster.