Skip to main content

On a SLR(k)-Based Parser System Which Accepts non-LR(k)Grammars

  • Chapter
GI-4.Jahrestagung

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 26))

  • 854 Accesses

Abstract

A context-free parser system based on DeRemer’s SLR(k)-method is described. It consists of

  1. (i)

    a parser generator constructing for any given context-free grammar SLR(k)control tables as far as practicable and

  2. (ii)

    a parser analysing sentences from left to right with occasional look-ahead. Emphasized is, by presenting some impressive examples, the treatment of nonLR(k) grammars in the system.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D.E.Knuth: On the translation of languages from left to right; Inf.Control 8, 607–639 (1965).

    MathSciNet  Google Scholar 

  2. W.R.Lalonde, E.S.Lee, J.J.Horning: An LALR(k) parser generator; Proc.IFIP Congress 71 TA–3–183–187, North–Holland Publ. (1972).

    Google Scholar 

  3. M.L.Joliat: Practical minimization of LR(k) parser tables; Proc.IFIP Congress 74 376–380, North-Holland Publ. (1974)

    Google Scholar 

  4. A.V.Aho, S.C.Johnson: LR parsing; ACM Comp.Surveys 6 99–124 (1974), [5] F.L.DeRemer: Simple LR(k) grammars; Coimn.ACM 14 453–460 (1971).

    Google Scholar 

  5. Practical translators for LR(k) languages; Project MAC, Oct.1969, MAC-TR-65, AD 699 501

    Google Scholar 

  6. H.H.Kron, H.-J.Hoffmann, G.Winkler: On an extension of SLR(k)-parsers to LR(k)parsers with unbounded k; Research Report PU1R2/74, Comp.Science Dept., Techn. Univ. in Darmstadt, Sept. 1974.

    Google Scholar 

  7. B.Lang: Deterministic techniques for efficient non-deterministic parsers; Lect. Notes in Comp.Sci.14 255–269, Springer (1974).

    Google Scholar 

  8. A.J.Korenjak: A practical method for constructing LR(k) parsers; Comm.ACM 12 613–623 (1969).

    Google Scholar 

  9. W.Mitteneder: Effizienter LR(1)-Parser; Diplomarbeit PO-S12, Comp.Science Dept., Techn. Univ. in Darmstadt, March 1974.

    Google Scholar 

  10. H.H.Kron: Modifizierter LR(k)-Parser; Studienarbeit PO-S2, Comp.Science Dept., Techn. Univ. in Darmstadt, Dec. 1972.

    Google Scholar 

  11. P.Branquart, et.al.: A context-free syntax of ALGOL 68; Inf.Proc.Letters 1 141–148 (1972).

    Google Scholar 

  12. M.Simonet: Une grammaire context-free d’ALGOL 68; Inst.Math.Appl. Grenoble(1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kron, H.H., Hoffmann, HJ., Winkler, G. (1975). On a SLR(k)-Based Parser System Which Accepts non-LR(k)Grammars. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-40087-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-39104-4

  • Online ISBN: 978-3-662-40087-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics