Some automatic transformations of CF-grammars

  • Roland Strobel
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 47)

Abstract

The paper describes a top-down syntactical analysis, where the goals are not nonterminals but syntactical vectors, delivering after completion an integer value. This value is used to select the subsequent vector. Some grammar transforming algorithms are presented which, at the cost of increasing the size of the grammar, make the parsing more efficient.

Keywords

Production Rule Null Vector Instruction Sequence Input String Critical Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Roland Strobel

There are no affiliations available

Personalised recommendations