Abstract

We have developed a logic grammar for circuit analysis. Circuits are viewed as sentences, and their elements as words. Circuit structures are defined by logic grammar called DCSG. A set of grammar rules, when converted into Prolog clauses, forms a logic program which execute top-down parsing. When we apply our methods to fundamental circuit analysis, problems of recursive definition occur. Recursive definitions often cause looping problems in logic programming. We will discusses several problems of recursive definition in circuit analysis.

Keywords

Logic Grammar Circuit Analysis Parsing Circuits DCG DCSG 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Greibach, S.A.: A New Normal Form Theorem for Context-Free Phrase Structure Grammars. JACM 12, 42–52 (1965)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Pereira, F.C.N., Warren, D.H.D.: Definite Clause Grammars for Language Analysis. Artificial Intell. 13, 231–278 (1980)CrossRefMATHGoogle Scholar
  3. 3.
    Tanaka, T.: Definite Clause Set Grammars: A Formalism for Problem Solving. J. Logic Programming 10, 1–17 (1991)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Tanaka, T.: Parsing Circuit Topology in A Logic Grammar. IEEE-Trans. Knowledge and Data Eng. 5(2), 225–239 (1993)CrossRefGoogle Scholar
  5. 5.
    Tanaka, T., Bartenstein, O.: DCSG-Converters in Yacc/Lex and Prolog. In: Proc. 12th International Conference on Applications of Prolog, pp. 44–49 (1999)Google Scholar
  6. 6.
    101 Analog IC Designs: Interdesign Inc., Sunnyvale, CA (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Takushi Tanaka
    • 1
  1. 1.Department of Computer Science and Engineering, Fukuoka Institute of Technology, 3-30-1 Wajiro-Higashi Higashi-ku, Fukuoka 811-0295Japan

Personalised recommendations