Is it possible to create a LL(1) table-driven (non-recursive) compiler with ANTLR or ANTLR3 ?
相关问题
- How do shader compilers work?
- C++ Builder - Difference between Lib and Res
- Why does constructing std::string(0) not emit a co
- Using Antlr to get identifiers and function names
- How do you parse a dangling else?
相关文章
- In ANTLR, how do you specify a specific number of
- Slow ANTLR4 generated Parser in Python, but fast i
- How to force Delphi compiler to display all hints
- Xcode - How to change application/project name : w
- What other neat tricks does the SpecialNameAttribu
- What is the purpose of “-Wa,option” in GCC? [close
- Why does the C++ compiler give errors after lines
- Can a compiler inline a virtual function if I use
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.