Accession Number:

AD0620657

Title:

A NECESSARY AND SUFFICIENT CONDITION FOR A CONTEXT-FREE GRAMMAR TO BE UNAMBIGUOUS

Descriptive Note:

Corporate Author:

SYSTEM DEVELOPMENT CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1965-07-28

Pagination or Media Count:

18.0

Abstract:

A class of context-free grammers called first-character-recognition grammars or fcr grammars is defined. These grammars obviously satisfy the necessary and sufficient condition consequently, they are unambiguous. It is shown to be a decidable question, whether a given grammar is an fcr grammar. Many programming languages can be described by fcr grammar. Many programming languages can be described by fcr grammars ALGOL can be so described, except for the distinction between arithmetic and Boolean expressions.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE