Skip to main content
Springer Nature Link
Log in

Recursive functions of context free languages (I)

The definitions of CFPRF and CFRF

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

It is intended to establish the recursive function theory on context free languages (CFLs). In this paper, the function class CFRF and its proper subclass CFPRF were defined on CFLs; it is quite straightforward to use them for describing non-numerical algorithms. In fact, they are respectively the partial recursive functions and primitive recursive functions of context free languages. The structure induction method for proving CFPRF function properties was presented. A method for CFL sentence enumeration was given, the minimization operator was defined. Based on CFL sentence enumeration, the minimization operator evaluation method was given. Finally, the design and implementation principles of executable specification languages with the CFRF as theoretical basis were discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Salomaa, A., Formal Languages, New York: Academic Press, 1973.

    MATH  Google Scholar 

  2. Cutland, N., Computability: An Introduction to Recursive Function Theory, Cambridge: Cambridge University Press, 1980.

    MATH  Google Scholar 

  3. Kleene, S. C., Introduction to Metamathematics, Amsterdam: Van Nostrand, Princeton and North-Holland, 1985.

    MATH  Google Scholar 

  4. Hu Shihua, Theory of recursive algorithms, Acta Mathematica Sinica (in Chinese), 1960, 10(1): 66–103.

    Google Scholar 

  5. McCarthy, J., Recursive functions of symbolic expressions Comm. ACM, 1960, 3(4): 184–195.

    Article  MATH  MathSciNet  Google Scholar 

  6. Dong Yunmei, Li Kaide, A class of formal grammars and its decision and parsing problems, Advances in Mathematics (in Chinese), 1965, 8(1): 1–33.

    Google Scholar 

  7. Dong Yunmei, Recursive functions of context free languages (II)—Validity of CFPRF and CFRF definitions, Science in China, Ser. F, to appear in 2002.

  8. Earley, J., An efficient context-free parsing algorithm, Comm. ACM, 1970, 13(2): 94–102.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, China

    Yunmei Dong

Authors
  1. Yunmei Dong
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yunmei Dong.

Additional information

This paper is based on the Technical Report ISCAS-LCS-2k-03 (SAQ Report No. 30): Recursive Functions Defined on Context Free Languages (I), August 2000, with minor revisions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, Y. Recursive functions of context free languages (I). Sci China Ser F 45, 25–39 (2002). https://doi.org/10.1360/02yf9002

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1360/02yf9002

Keywords