Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2010: Developments in Language Theory pp 434–435Cite as

On Restricted Context-Free Grammars

  • Conference paper

  • 578 Accesses

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

Abstract

In context-free grammars, each derivation step can be characterized so that (i) a nonterminal of the current sentential form is chosen and (ii) rewritten by a rule. However, it is well-known that context-free grammars are not able to cover all aspects of natural languages and/or programming languages. Therefore, there were defined many grammars with context-free rules and some mechanism controlling the application of rules, e. g., in random context grammars and their variants, a rule is only applicable if the current sentential form contains some letters or subwords and some letters or words do not occur in it. Therefore, in grammars controlled by context, each derivation step can be characterized so that (i) subsets of applicable nonterminals and rules are determined according to the symbols appearing in the current sentential form, (ii) an applicable nonterminal is chosen and (iii) rewritten by an applicable rule.

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 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. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Google Scholar 

  2. Masopust, T.: Simple Restriction in Context-Free Rewriting. (submitted for publication)

    Google Scholar 

  3. Meduna, A., Švec, M.: Grammars with Context Conditions and Their Applications. John Wiley & Sons, New York (2005)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016, Magdeburg, Germany

    Jürgen Dassow

  2. Institute of Mathematics, Czech Academy of Sciences, Žižkova 22, CZ-61662, Brno, Czech Republic

    Tomáš Masopust

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomáš Masopust
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J., Masopust, T. (2010). On Restricted Context-Free Grammars. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation