Accession Number:

AD0770029

Title:

The Equivalence of Reducing Transition Languages and Deterministic Languages,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Schkolnick,Mario

Report Date:

1973-07-01

Pagination or Media Count:

11.0

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 the paper the author extends this result showing that in fact, the first class is equivalent to the class of deterministic context free languages. Author

Descriptors:

• (*Programming languages
• *Context free grammars)
• Mathematical logic
• Theorems

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE