Return to search

A Left-to-Right Parsing Algorithm for THIS Programming Language

The subject of this investigation is a specific set of parsers known as LR parsers. Of primary interest is a LR parsing method developed by DeRemer which specifies a translation method which can be defined by a Deterministic Push-Down Automation (DPDA). The method of investigation was to apply DeRemer's parsing technique to a specific language known as THIS Programming Language (TPL). The syntax of TPL was redefined as state diagrams and these state diagrams were, in turn, encoded into two tables--a State-Action table and a Transition table. The tables were then incorporated into a PL/l adaptation of DeRemer's algorithm and tested against various TPL statements.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc504412
Date05 1900
CreatorsHooker, David P.
ContributorsIrby, Thomas C., Haynes, Jack Read
PublisherNorth Texas State University
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
Formatv, 221 leaves: ill., Text
RightsPublic, Hooker, David P., Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved.

Page generated in 0.0023 seconds