ANTLR: A predicated‐<i>LL</i>(<i>k</i>) parser generator

書誌事項

公開日
1995-07
権利情報
  • http://onlinelibrary.wiley.com/termsAndConditions#vor
DOI
  • 10.1002/spe.4380250705
公開者
Wiley

この論文をさがす

説明

<jats:title>Abstract</jats:title><jats:p>Despite the parsing power of <jats:italic>LR/LALR</jats:italic> algorithms, e.g. YACC, programmers often choose to write recursive‐descent parsers by hand to obtain increased flexibility, better error handling, and ease of debugging. We introduce ANTLR, a public‐domain parser generator that combines the flexibility of hand‐coded parsing with the convenience of a parser generator, which is a component of PCCTS. ANTLR has many features that make it easier to use than other language tools. Most important, ANTLR provides <jats:italic>predicates</jats:italic> which let the programmer systematically direct the parse via arbitrary expressions using semantic and syntactic context; in practice, the use of predicates eliminates the need to hand‐tweak the ANTLR output, even for difficult parsing problems. ANTLR also integrates the description of lexical and syntactic analysis, accepts <jats:italic>LL(k)</jats:italic> grammars for <jats:italic>k</jats:italic> > 1 with extended BNF notation, and can automatically generate abstract syntax trees.</jats:p><jats:p>ANTLR is widely used, with over 1000 registered industrial and academic users in 37 countries. It has been ported to many popular systems such as the PC, Macintosh, and a variety of UNIX platforms; a commercial C++ front‐end has been developed as a result of one of our industrial collaborations.</jats:p>

収録刊行物

被引用文献 (3)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ