Affordable Access

On the covering of parsable grammars

Authors
Publisher
Academic Press
Publication Date

Abstract

The notion of a parsable grammar is introduced. A definition of cover is provided which is a generalization of a well-known definition of cover. With this new definition of cover we prove that every parsable grammar is covered by an LR(1) grammar or, if the language is prefic-free, by a strict-deterministic grammar. A consequence of this result is that every LR(k) grammar is covered by an LR(1) or a strict deterministic grammar.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

On the covering of parsable grammars

on Journal of Computer and System... Jan 01, 1977

Bounded context parsable grammars

on Information and Control Jan 01, 1975
More articles like this..