Generator of Recursive Descent Parsers for LL(K) Languages

摘要

A computer program was designed to generate a recursive-descent compiler for LL(k) languages. A grammar specification language was designed using Extended BNF, along with a lexical analyzer specification language using regular expressions. The program uses a well-tested but not formally proven method for determining the maximum possible k for a grammar. It then uses an iterative first and follow set calculation algorithm to determine the actual k for the grammar.