Abstract
Many structures used in computer science and software can be represented by context-free languages. This paper discusses computable functions on such languages, which give a useful model for studies of computability and algorithms involving complex data structures. This paper further tackles some practical issues for using the functions. Some practical schemes of the functions are presented. A subclass of functions is provided, which can be implemented efficiently.
Research supported by NSFC under Grants Nos. 60573013, 60273023, 60421001.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 3–25. Springer, Heidelberg (2002)
Chen, H., Dong, Y.: Definition forms of recursive functions defined on contextfree languages (In Chinese) Technical Report ISCAS-LCS-99-15, Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences (1999)
Chen, H.: Statically typed XML processing by the LFC language. In: Sixth International Conference on Information Technology (CIT 2003), Bhubaneswar, India, pp. 177–182 (2003)
Chen, H.: Practical operators for a kind of recursive functions, Technical Report ISCAS-LCS-04-11, Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences (2004)
Chen, H.: Evaluation algorithms of a new kind of recursive functions. Journal of Software 15(9), 1277–1291 (2004) (in Chinese)
Chen, H., Dong, Y.: Pattern matching compilation of functions defined on context-free languages. Journal of Comput. Sci. & Technol. 16(2), 159–167 (2001)
Chen, H., Dong, Y.: Yet another meta-language for programming language processing. ACM SIGPLAN Notices 37(6), 28–37 (2002)
Chen, H., Dong, Y.: Practical type checking of functions defined on context-free languages. J. Comput. Sci. & Technol. 19(6), 840–847 (2004)
Dong, Y., Li, K., Chen, H., et al.: Design and implementation of the formal specification acquisition system SAQ. In: Proceedings of Conference on Software: Theory and Practice, IFIP 16th World Computer Congress 2000, Beijing China, pp. 201–211 (2000)
Dong, Y.: Recursive functions of context free languages (I). The definitions of CFPRF and CFRF, Science in China, Series F 45(1), 25–39 (2002)
Dong, Y.: Recursive functions of context free languages (II). Validity of CFPRF and CFRF definitions, Science in China, Series F 45(2), 1–21 (2002)
Freudig, J., Lowe, W., Neumann, R., Trapp, M.: Subtyping of context-free classes. Institute fur Programmstrukturen und Datenorganisation. Universitat Karlsruhe, Germany (1998)
Gyssens, M., Van Gucht, D.: A grammar-based approach towards unifying hierarchical data models. SIAM Journal on Computing 23(6), 1093–1137 (1994)
Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80–95. Springer, Heidelberg (2002)
Javed, F., Mernik, M., Bryant, B.R., Gray, J.: A grammar-based approach to class diagram validation. In: Fourth International Workshop on Scenarios and State Machines: Models, Algorithms and Tools (SCESM), St. Louis, MO (2005)
Klint, P., Lammel, R., Verhoef, C.: Towards an engineering discipline for grammarware. ACM Transaction on Software Engineering and Methodology 14(3), 331–380. (2005), Available from http://www.cs.vunl/grammarware/
Mernik, M., Crepinsek, M., Kosar, T., et al.: Grammar-based systems: definition and examples. Informatica 28(3), 245–254 (2004)
Reps, T.: Program Analysis via Graph Reachability. Information and Software Technology (1998)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Word, Language, Grammar 1 (1997)
Tucker, J.V., Zucker, J.I.: Computable functions and semicomputable sets on many sorted algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic for Computer Science. Logic and Algebraic Methods, vol. 5, pp. 317–523. Oxford University Press, Oxford (2000)
Tucker, J.V., Zucker, J.I.: Abstract computability and algebraic specification. ACM Transactions on Computational Logic 3, 279–333 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, H., Dong, Y. (2006). Towards Practical Computable Functions on Context-Free Languages. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_53
Download citation
DOI: https://doi.org/10.1007/11750321_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)