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.
|Number of pages||13|
|Publication status||Published - Jul 1977|
|Event||Fourth Conference on Automata, Languages and Programming - Turku, Finland|
Duration: 18 Jul 1977 → 22 Jul 1977
|Conference||Fourth Conference on Automata, Languages and Programming|
|Period||18/07/77 → 22/07/77|
|Other||18-22 July 1977|