Page History

...

• a Scheme program in the file boolsimp.ss equivalent to the Java program that you are required to write;
• a Java "stub" file boolSimp.dj1 that defines a composite hierarchy of "abstract syntax" tree classes rooted in the class Form representing boolean expressions;
• a Java library file Parser.java contain a class Parser with
  • a read() method that reads a boolean expression represented in "Scheme form" and returns the corresponsing Java Form abstract syntax tree and
  • a simplifyreduce() method that composes the visitors you must write in boolSimp.dj1 to reduce whatever formula the Parser instance contains to simplified form.
• a Java "stub" test file boolSimpTest.java that includes some rudimentary tests of the code in the boolSimp.dj1 stub file.

...