Skip to main content
SpringerLink
Log in

LL(1) grammars and Sub-LL(1) grammars

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

LL(1) grammars play an important role in top-down parsing. In order to improve their efficiency, this paper presents a new type of grammar, Sub-LL(1), based on LL(1), and shows that there is a grammar which is Sub-LL(1) and not LL(1) though LL(1)- and Sub-LL(1)-languages are identical.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Griffiths, LL(1) grammars and analysers, Compiler Construction, F. L. Bauer and J. Eickel (eds.) Springer-Verlag (1974).

  2. A. V. Aho and J. D. Ullman, The theory of parsing, translation, and compiling, Vol. 1, p. 343, Prentice-Hall (1972).

  3. J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).

  4. A. V. Aho and J. D. Ullman, Principles of compiler design, Addison-Wesley (1977).

  5. P. M. Lewis, II et al., Compiler design theory, Addison-Wesley (1976).

Download references

Author information

Authors and Affiliations

  1. Computer Center, Shenzhen University, Shenzhen, Guangdong, P.R. China

    Chen Jinhua

Authors
  1. Chen Jinhua
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jinhua, C. LL(1) grammars and Sub-LL(1) grammars. International Journal of Computer & Information Sciences 14, 225–234 (1985). https://doi.org/10.1007/BF00997021

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00997021

Key words

Search

Navigation