Abstract
Context-free programmed grammars (CFPG) are considered powerful for string language description in syntactic pattern analysis. Recursive structures are the most important features of CFPG. The relations between CFPG and recursive language structures have been systematically studied and consequently a unique theory of CFPG inferability has been obtained by means of investigating recursion formats of basic recursive structures. According to the theory a CFPG can be constructed for a language if the sufficient and necessary conditions are satisfied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. S. Fu,Syntactic Pattern Recognition and Applications, Prentice-Hall, Englewood Cliffs, New Jersey, (1982).
K. S. Fu and T. L. Booth, Grammatical inference: introduction and survey, Part I and II,IEEE Trans. Syst. Man Cybern. SMC-5, pp. 59–72; pp. 409–423 (1975).
R. C. Gonzalez and M. G. Thomason,Syntactic Pattern Recognition — An Introduction, Addison-Wesley, Reading, Massachusetts, (1978).
M. G. Thomason, Syntactic/semantic techniques in pattern recognition: a survey,Int. J. Comput. Inf. Sci. 11, 75–100 (1982).
A. W. Biermann and J. A. Feldman, A survey of results in grammatical inference,in Frontiers of Pattern Recognition (S. Watanabe, ed.). Academic Press, New York, 1972.
T. G. Evans, Grammatical inference techniques in pattern analysis, inSoftware Engineering (J. T. Tou, ed.) Vol. 2, Academic Press, New York, 1971.
J. J. Horning, A procedure for grammatical inference,IFIP Congr., Yugoslavia (August 1971).
S. Crespi-Reghizzi, An effective model for grammar inference,IFIP Congr., Yugoslavia, (August 1971).
S. Crespi-Reghizzi, Reduction of enumeration in grammar acquisition,Proc. 2nd Int. Joint Conf. Artif. Inteli., London (September 1971).
T. W. Pao and J. W. Carr, A solution of the syntactical induction inference problem for regular languages,Compt. Lang. 3, 53–64 (1978).
H. R. Lu and K. S. Fu, Inference of context-free programmed grammars,Technical Report TR-EE 83, School of Electrical Engineering, Purdue University, West Lafayette, Indiana, (April 1983).
H. R. Lu and K. S. Fu, A general approach to inference of context-free programmed grammars, accepted for publication in IEEE Transactions on Systems, Man, and Cybernetics, (1984).
D. J. Rosenkrantz, Programmed grammars and classes of formal languages,JACM 16, 117–131 (1969).
D. J. Rosenkrantz, Programmed grammars: a new device for generating formal languages8th IEEE Annu. Symp. Switching Automata Theory, Austin, Texas, (1967).
J. W. Tai and K. S. Fu, Inference of a class of CFPG by means of semantic rules,”Int. J. Comput. Inf. Sci. 11, 1–23 (1982).
A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation and Compiling, Vol. 1, Parsing, Prentice-Hall, Englewood Cliffs, New Jersey, (1972).
Author information
Authors and Affiliations
Additional information
This work was supported in part by the NSF Grant ECS 81-19886.
The author is presently on leave from Department of Electrical Engineering, Zhejiang University, Hangzhou, Zhejiang, The People's Republic of China.
Rights and permissions
About this article
Cite this article
Lu, H.R., Fu, K.S. Inferability of context-free programmed grammars. International Journal of Computer and Information Sciences 13, 33–58 (1984). https://doi.org/10.1007/BF00989482
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00989482