Is it possible to create a LL(1) table-driven (non-recursive) compiler with ANTLR or ANTLR3 ?
Is it possible to create a LL(1) table-driven (non-recursive) compiler with ANTLR or ANTLR3
Share
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.
Is it possible to create a LL(1) table-driven (non-recursive) compiler with ANTLR or ANTLR3 ?
No.
However since ANTLR is open source you could modify a fork of ANTLR to do it.
ANTLR builds lexers and parsers as recursive descent source code. This is why ANTLR is easy to use and popular because people can look at the source code and understand how the lexer and parser work versus looking at table entries. Because it is source code, one can also use tools to debug the source code. If ANTLR used tables instead of source code output it would lose its ease of understanding and usefulness for those learning lexing and parsing on their own.