Skip to main content
Log in

On strict interpretations of grammar forms

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Strict interpretations of grammar forms are studied with respect to parsing, ambiguity, and decidability for intersection and containment. In particular, a parsing procedure for an arbitrary strict interpretation grammar is given which is based on a given parsing method for the master grammar. Time and space bounds on the new procedure are then obtained. Each ambiguous interpretation grammar of an unambiguous grammar form can be converted to an equivalent unambiguous interpretation of the same grammar form. Unambiguity is always decidable for strict interpretation grammars of unambiguous grammar forms. Also, for languages obtained from “compatible” strict interpretations of an unambiguous grammar form, the following problems are solvable: empty intersection, finite intersection, containment, and equality.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Bertsch, An observation on relative parsing time,Journal of the Association for Computing Machinery, 22, 493–498, (1975).

    Google Scholar 

  2. A. B. Cremers and S. Ginsburg, Context-free grammar forms,Journal of Computer and System Sciences, 11, 86–117, (1975).

    Google Scholar 

  3. A. B. Cremers, S. Ginsburg, and E. H. Spanier, The structure of context-free grammatical families,Journal of Computer and System Sciences, 15, 262–279, (1977).

    Google Scholar 

  4. A. J. Demers, Skeletal LR Parsing,15th Annual Symposium on Switching and Automata Theory, New Orleans, LA, 1974.

  5. R. Haskell, Formal languages: structure preserving maps and decidability properties,Ph.D. Dissertation, Imperial College, London, 1970.

    Google Scholar 

  6. N. A. Lynch, Log space recognition and translation of parenthesis languages,Journal of the Association for Computing Machinery, 24, 583–590, (1977).

    Google Scholar 

  7. R. McNaughton, Parenthesis grammars,Journal of the Association for Computing Machinery, 14, 490–500, (1967).

    Google Scholar 

  8. M. Nivat, Extensions et restrictions de grammaires algebriques, inFormal Languages and Programming (ed. Aguilar), North-Holland, 129 p.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This author was supported in part by a Guggenheim Fellowship and by NSF Grant No. 42306 and MCS 73-03380.

This author was supported in part by NSF Grant No. MCS76-10076.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ginsburg, S., Leong, B., Mayer, O. et al. On strict interpretations of grammar forms. Math. Systems Theory 12, 233–252 (1978). https://doi.org/10.1007/BF01776576

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01776576

Keywords

Navigation