Skip to main content
SpringerLink
Log in

Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5549))

Included in the following conference series:

  • 1588 Accesses

Abstract

A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute dependencies. A memoization technique is used with this non-strict method for efficiently processing ambiguous input. This one-pass approach allows Natural Language (NL) processors to be constructed as executable, modular and declarative specifications of Attribute Grammars.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D.: The Theory of Parsing, vol. I. Prentice-Hall, Englewood Cliffs (1972)

    MATH  Google Scholar 

  2. Bird, R.S.: Intro. to Functional Programming in Haskell. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  3. De Moor, O., Backhouse, K., Swierstra, D.: First-class attribute grammars. In: WAGA (2000)

    Google Scholar 

  4. Frost, R.A., Hafiz, R., Callaghan, P.: Modular and efficient top-down parsing for ambiguous left-recursive grammars. In: 10th IWPT, ACL, pp. 109–120 (2007)

    Google Scholar 

  5. Frost, R.A., Hafiz, R., Callaghan, P.: Parser combinators for ambiguous left-recursive grammars. In: 10th PADL, vol. 4902, pp. 167–181. ACM, New York (2008)

    Google Scholar 

  6. Knuth, D.E.: Semantics of context-free languages. Theory of Comp. Systems 2(2), 127–145 (1968)

    MathSciNet  MATH  Google Scholar 

  7. Wadler, P.: Monads for functional programming. First International Spring School on Advanced Functional Programming Techniques 925, 24–52 (1995)

    Article  Google Scholar 

  8. Warren, D.S.: Programming the ptq grammar in xsb. In: Workshop on Programming with Logic Databases, pp. 217–234 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, Canada

    Rahmatullah Hafiz

Authors
  1. Rahmatullah Hafiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, 3333 University Way, V1V 1V5, Kelowna, British Columbia, Canada

    Yong Gao

  2. School of Information Technology & Engineering, University of Ottawa, 800 King Edward Avenue, P.O. Box 450, K1N 6N5, Stn. A, Ottawa, Ontario, Canada

    Nathalie Japkowicz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hafiz, R. (2009). Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion. In: Gao, Y., Japkowicz, N. (eds) Advances in Artificial Intelligence. Canadian AI 2009. Lecture Notes in Computer Science(), vol 5549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01818-3_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01818-3_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01817-6

  • Online ISBN: 978-3-642-01818-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation