ANTLR: a predicated- LL(k) parser generator

摘要: SUMMARY Despite the parsing power of LR=LALR algorithms, e.g. YACC, programmers often choose to write recursive-descent parsers by hand obtain increased flexibility, better error handling, and ease debugging. We introduce ANTLR, a public-domain parser generator that combines flexibility hand-coded with convenience generator, which is component PCCTS. ANTLR has many features make it easier use than other language tools. Most important, provides predicates let programmer systematically direct parse via arbitrary expressions using semantic syntactic context; in practice, eliminates need hand-tweak output, even for difficult problems. also integrates description lexical analysis, accepts LL(k) grammars k> 1with extended BNF notation, can automatically generate