Skip to main content

Practical Comparison Between the LR(1) Bottom-Up and LL(1) Top-Down Methodology

  • Conference paper
  • First Online:
Digital Transformation Technology

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 224))

  • 1191 Accesses

Abstract

The syntax analysis or parser is the essential stage of designing compilers, and the role of the parser is parsing strings according to a definite number of rules. Researchers often use either LL(1) top-down technique or LR bottom-up technique to parse strings to decide whether all these strings or some of them are accepted by some defined language. Theoretically, many papers illustrated that the LR method is more suitable for LL(1). The current paper treats the problem of parsing practically. It proves that the LR technique is more suitable of LL(1) in terms of the computing time of parsing in each technique.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Su Y, Yan SY (2011) Principles of compilers—a new approach to compilers including the algebraic method. Higher Education Press, Beijing and Springer Heidelberg Dordrecht, London, New York

    Google Scholar 

  2. Ah AV, Lam MS, Sethi R, Ullman JD (2007) Compilers—principles, techniques, and tools. Pearson Addison Wesley, New York

    Google Scholar 

  3. Jacobs CJH, Kees DG, Bal HE, van Reeuwijk (2012) Modern compiler design. Springer, New York, Heidelberg Dordrecht London

    Google Scholar 

  4. Waite WM, Goos G (1994) Compiler construction. Springer-Verlag, Berlin, New York

    Google Scholar 

  5. Holub AI (1990) Compiler design in C. Prentice Hall, New Jersey

    Google Scholar 

  6. Meduna A (2008) Elements of compiler design. Auerbach Publications, New York

    MATH  Google Scholar 

  7. Ismail IA, Ali NA (2019) LL(1) as a property is not enough for obtaining proper parsing. In: The first world conference on internet of things: applications & future. French University-Cairo, SPRINGER Peer-Reviewed Proceedings, Cairo

    Google Scholar 

  8. Ægidius Mogensen T (2011) An introduction to compiler design. Springer-Verlag, London

    Google Scholar 

  9. Ismail IA, Ali NA (2017) Parsing strings using a subset of the production rules of the C-language. Egypt Comput Sci J 41:30–35

    Google Scholar 

  10. Ægidius Mogensen T (2010) Basics of compiler design. Published through lulu.com. University of Copenhagen, Copenhagen

    Google Scholar 

  11. Puntambekar AA (2008) Compiler design. Technical Publication

    Google Scholar 

  12. Maheshwari A, Smid M (2017) Introduction to theory of computation. Carleton University, Canada

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ali, N.A. (2022). Practical Comparison Between the LR(1) Bottom-Up and LL(1) Top-Down Methodology. In: Magdi, D.A., Helmy, Y.K., Mamdouh, M., Joshi, A. (eds) Digital Transformation Technology. Lecture Notes in Networks and Systems, vol 224. Springer, Singapore. https://doi.org/10.1007/978-981-16-2275-5_10

Download citation

Publish with us

Policies and ethics