Skip to main content

Whale Calf, a Parser Generator for Conjunctive Grammars

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2002)

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

Included in the following conference series:

Abstract

Whale Calf is a parser generator that uses conjunctive grammars, a generalization of context-free grammars with an explicit intersection operation, as the formalism of specifying the language. All existing parsing algorithms for conjunctive grammars are implemented — namely, the tabular algorithm for grammars in the binary normal form, the tabular algorithm for grammars in the linear normal form, the tabular algorithm for arbitrary grammars, the conjunctive LL, the conjunctive LR and the algorithm based on simulation of the automata equivalent to linear conjunctive grammars. The generated C++ programs can determine the membership of strings in the language and, if needed, create parse trees of these strings.

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 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. Graphviz-open source graph drawing software, available at http://www.research.att.com/sw/tools/graphviz/.

  2. A. Okhotin, “Conjunctive grammars”, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519–535.

    MATH  MathSciNet  Google Scholar 

  3. A. Okhotin, “Top-down parsing of conjunctive languages”, Grammars, 5:1 (2002), 21–40.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Okhotin, “A recognition and parsing algorithm for arbitrary conjunctive grammars”, to appear in Theoretical Computer Science.

    Google Scholar 

  5. A. Okhotin, “LR parsing for conjunctive grammars”, Grammars, 5:2 (2002), 81–124.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Okhotin, “On a new family of automata”, Technical Report 2002-456, Department of Computing and Information Science of Queen’s University, Kingston, Ontario, Canada.

    Google Scholar 

  7. A. Okhotin, “Efficient automaton-based recognition for linear conjunctive languages”, this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okhotin, A. (2003). Whale Calf, a Parser Generator for Conjunctive Grammars. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-44977-9_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40391-3

  • Online ISBN: 978-3-540-44977-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics