Text processing often involves matching text against a Pattern. Although Java s character and assorted string classes offerlow- levelPattern- matching support, that support commonly leads to complex code. To help you write simplerPattern- matching code, Java provides regular expressions. After introducing you to terminology and thejava.util. regex package, Jeff Friesen explores many regular expression constructs supported by that package s Pattern class. Then he examines Pattern s methods and the additionaljava.util. regex classes. In conclusion, he presents a practical application of regular expressions.
DAGON Approach
Object of this exercise:
Given a subject graph and a set of Pattern graph in canonical representation (2-input
NAND and INV), implement the second step of DAGON approach. (Both the subject
graph and the Pattern graphs are trees.)
