Journal of Computer Science and Technology

, Volume 3, Issue 4, pp 310–316 | Cite as

A non-recursive algorithm computing set expressions

  • Lian Lin 
  • Zhang Yili 
  • Tang Changjie 
Short Papers


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.


Result Expression Disjunctive Normal Form Paper Concern Algorithm 9implifying Outer Level 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    Chen Huowang, Qian Jiahua and Shen Yongqiang, Programming Languages: The Principle of Compiling, GuoFangGongYe Press 1984, 88–119.Google Scholar
  3. [3]
    D.F. Stahat and D.F. Mcallister, Discrete Mathematics in Computer Science, Prentice-Hall, Inc. 1977, 85–94.Google Scholar
  4. [4]
    Avron Barr and Edward A. Feigenbaum, The Handbook of Artificial Intelligence, Vol. 2. William Kaufmann, Inc. 1982, 236–294.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1988

Authors and Affiliations

  • Lian Lin 
    • 1
  • Zhang Yili 
    • 1
  • Tang Changjie 
    • 1
  1. 1.Sichuan UniversityChengdu

Personalised recommendations