Discrete Mathematics

----------------------------SYMBOLIC

LOGIC 47

We know that a parser is part

of

a compiler. Basically, a parser attempts to find the structure

of

a

program, without necessarily

"understanding" what the program does.

In English, there is something similar. We shall be able to tell a sentence has a structure, even without

understanding the words. For example,

"The footing fooferall wikked umtily". Except for the word "the", the

rest are made up. However, based on certain patterns, we can deduce that

"footing" is probably an adjective,

"fooferall" a noun and "wikked" a verb. Even

if

we did understand the words, we shall be able to tell that ...