What I miss in the book is more details and more clarity as to the nature and power of the parser generating algorithm. I would be glad to read more about e.g. :
- Is ANTLR capable of generating a parser for every LL(k) grammar? Or for every strong LL(k) grammar? Or for some other class of LL(k) grammars?
- How does ANTLR handle lookahead of more than 1 symbol?
- Are there limitations to ANTLR LL(*) other than the lookahead language being regular? If yes then what?
- What are the limitations to use of recursion in lexer rules?