Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2018: Language and Automata Theory and Applications pp 60–67Cite as

Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects

  • Conference paper
  • First Online:

  • 466 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10792))

Abstract

The CF formal grammar model was twin-born and raised, 1956–1963 [Caa, CS, BGS, BPS].

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5_3. Chap. 3

    Chapter  Google Scholar 

  2. Bar-Hillel, Y., Gaifman, H., Shamir, E.: On categorical and phrase structure grammars. Bull. Res. Coun. Isr. 9F, 1–16 (1960)

    MATH  Google Scholar 

  3. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitsch. Phonetick Spracgwiss. Kommunikationsforshcung 14, 143–172 (1961)

    MathSciNet  MATH  Google Scholar 

  4. Chomsky, N.: Three models for the description of language. IRE Trans. Inf. Theory IT–2, 113–124 (1956)

    Article  MATH  Google Scholar 

  5. Chomsky, N., Schüizenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, S. (eds.) Computer Programming and Formal Systems, pp. 116–121. North-Holland, Amsterdam (1970)

    Google Scholar 

  6. Frank, R.: Phrase Structure Composition and Syntatic Dependencies. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  7. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw Hill, New York (1966)

    MATH  Google Scholar 

  8. Greibach, S.: A new normal for theorem for context-free phrase structure grammars. J. Assoc. Comput. Math. 12, 42–52 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  9. Greibach, S.: The hardest context-free language. SIAM J. Comput. 3, 304–310 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Grune, D., Jacobs, C.J.H.: Parsing as intersection. In: Grune, D., Jacobs, C.J.H. (eds.) Parsing Techniques: A Practical Guide. MCS, pp. 425–442. Springer, New York (2008). https://doi.org/10.1007/978-0-387-68954-8_13

    Chapter  Google Scholar 

  11. Hopcroft, J., Ullman, J.: Formal Languages and Their Relation to Automata. Addison-Wesley, Boston (1969)

    MATH  Google Scholar 

  12. Hotz, G., Kretschmer, T.: The power of Greiback norm form. Electron. Infor. Kybernet. 25, 507–512 (1989)

    MATH  Google Scholar 

  13. Jones, N.C., Pevzner, P.A.: Introduction to Bioinformatics Algorithnms. MIT Press, Cambridge (2004)

    Google Scholar 

  14. Kallmeyer, L.: Parsing Beyond Context Free Grammars. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14846-0

    Book  MATH  Google Scholar 

  15. Shamir, E.: A representation theorm for algebraic and context-free power series in noncommuting variables. Inf. Comput. 11, 239–254 (1967)

    MATH  Google Scholar 

  16. Shamir, E.: Some inherently ambiguous context-free languages. Inf. Control 18, 355–363 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shamir, E.: Pumping, shrinking and pronouns: from context free to indexed grammars. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 516–522. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37064-9_45

    Chapter  Google Scholar 

  18. Shamir, E.: Decomposition and parsing of non-expansive context-free grammars (2017, manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hebrew University of Jerusalem, Jerusalem, Israel

    Eli Shamir

Authors
  1. Eli Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eli Shamir .

Editor information

Editors and Affiliations

  1. Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shamir, E. (2018). Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. In: Klein, S., Martín-Vide, C., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science(), vol 10792. Springer, Cham. https://doi.org/10.1007/978-3-319-77313-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77313-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77312-4

  • Online ISBN: 978-3-319-77313-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation