A class of linearly parsable graph grammars

@article{Franck1978ACO,
  title={A class of linearly parsable graph grammars},
  author={Reinhold Franck},
  journal={Acta Informatica},
  year={1978},
  volume={10},
  pages={175-201}
}
Specializing an existing graph grammar model we look in detail at node context-free graph grammars. With a slight generalization the parse trees for context-free Chomsky grammars can be used to describe derivations of these graph grammars. As shown already in former works the precedence graph grammars are defined as a subclass of context-free graph grammars… CONTINUE READING