A Generator of Recursive Descent Parsers for LL(K) Languages.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1983
Accession Number
ADA138061

Entities

People

  • G. B. Paprotny

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • C Programming Language
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Crystal Structure
  • Grammars
  • High Level Languages
  • Inertial Measurement Units
  • Insensitive Explosives
  • Language
  • Object Code
  • Operating Systems
  • Plastic Explosives
  • Software Development
  • Tank Guns

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Software Engineering.