Accession Number : ADA138061
Title : A Generator of Recursive Descent Parsers for LL(K) Languages.
Descriptive Note : Master's thesis,
Corporate Author : AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
Personal Author(s) : Paprotny,G B
PDF Url : ADA138061
Report Date : Dec 1983
Pagination or Media Count : 312
Abstract : 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.
Descriptors : *Compilers, *Programming languages, Parsers, Grammars, Requirements, Specifications, Algorithms, Context sensitive grammars, Context free grammars, Recursive functions, Interfaces, Formats, Input output processing, Theses
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE