1990•ACM SIGPLAN NoticesOpen access

Generation and recognition of formal languages by modifiable grammars

Boris Burshteyn

Abstract

In this article the formal definitions of modifiable grammars are presented, and the equivalence between classes of modifiable grammars and Turing machines is proved. Some criteria for reducing modifiable grammars to context-free grammars are provided. A lazy LR(1) algorithm for context-free grammars and an algorithm for constructing a LR(1) parser for modifiable grammars are discussed.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: L-attributed grammar, Context-free grammar, Context-sensitive grammar, Computer science, Tree-adjoining grammar, Indexed grammar, Phrase structure grammar, Parsing expression grammar