A New Grammatical Transformation into Deterministic Top-Down Form

Abstract

Although deterministic top-down parsing is an attractive parsing technique, the grammars to which it is applicable (the LL(k) grammars) are but a small subset of the LR(k) grammars, those that can be parsed deterministically bottom-up. In this thesis, the problem of transforming LR(k) grammars into equivalent LL(k) grammars is studied. A new transformation procedure is devised which is more powerful than currently available techniques and which preserves the compiling ability of the grammar.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1974
Accession Number
AD0775545

Entities

People

  • Michael M. Hammer

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Automata
  • Commerce
  • Computations
  • Computer Programming
  • Computers
  • Context Free Grammars
  • Electrical Engineering
  • Grammars
  • Language
  • Linguistics
  • Machines
  • Semantics
  • Standards
  • Thinking
  • Translations

Readers

  • Computational Linguistics