Thumbnail
Access Restriction
Subscribed

Author Schkolnick, Mario
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Reducing transition languages ♦ Syntax controlled generators ♦ Deterministic context-free grammars
Abstract The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages.
Description Affiliation: Carnegie-Mellon Univ., Pittsburgh, PA (Schkolnick, Mario)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 9
Page Count 4
Starting Page 517
Ending Page 520


Open content in new tab

   Open content in new tab
Source: ACM Digital Library