Abstract
This paper concerns set expressions satisfying some constraints. Although algorithms processing expressions (for every kind) have been proposed in compilers, almost all of them use stacks and recursions, and adopt complicated parsing techniques. However, the simplification of set expressions can be done easily by its special characteristics. In this paper, we propose linear, nonrecursive, and thus efficient algorithms simplifying set expressions. The method can be well used in proposition calculus.
This is a preview of subscription content, log in via an institution to check access.
References
A.V. Aho. J.E. Hoperoft and J.D. Ullman, An Introduction to Automata Theory, Languages, and Computation Addison-Wesley Publishing Company, Inc. 1979, 248–264.
Chen Huowang, Qian Jiahua and Shen Yongqiang, Programming Languages: The Principle of Compiling, GuoFangGongYe Press 1984, 88–119.
D.F. Stahat and D.F. Mcallister, Discrete Mathematics in Computer Science, Prentice-Hall, Inc. 1977, 85–94.
Avron Barr and Edward A. Feigenbaum, The Handbook of Artificial Intelligence, Vol. 2. William Kaufmann, Inc. 1982, 236–294.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lian, L., Zhang, Y. & Tang, C. A non-recursive algorithm computing set expressions. J. of Compt. Sci. & Technol. 3, 310–316 (1988). https://doi.org/10.1007/BF02943355
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943355