### Abstract

Original language | Undefined |
---|---|

Pages | 352-364 |

Number of pages | 13 |

DOIs | |

Publication status | Published - Jul 1977 |

### Keywords

- IR-66788
- EWI-8807

### Cite this

*Simple chain grammars*. 352-364. https://doi.org/10.1007/3-540-08342-1_27

}

**Simple chain grammars.** / Nijholt, Anton; Salomaa, Arto (Editor); Steinby, Magnus (Editor).

Research output: Contribution to conference › Paper

TY - CONF

T1 - Simple chain grammars

AU - Nijholt, Anton

A2 - Salomaa, Arto

A2 - Steinby, Magnus

PY - 1977/7

Y1 - 1977/7

N2 - A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not in this paper) that each simple chain grammar has an equivalent simple LL(1) grammar. A very simple (bottom-up) parsing method is provided. This method follows directly from the definition of a simple chain grammar and can easily be given in terms of the well-known LR(0) parsing method.

AB - A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not in this paper) that each simple chain grammar has an equivalent simple LL(1) grammar. A very simple (bottom-up) parsing method is provided. This method follows directly from the definition of a simple chain grammar and can easily be given in terms of the well-known LR(0) parsing method.

KW - IR-66788

KW - EWI-8807

U2 - 10.1007/3-540-08342-1_27

DO - 10.1007/3-540-08342-1_27

M3 - Paper

SP - 352

EP - 364

ER -