Quiz 3 (CS1573)

  1. Draw a finite state automaton that accepts the language described by the regular expression (a|b)*b

  2. Discuss one reason why understanding a computer programming language is easier than understanding a natural (human) language such as English.

  3. Given the sentence "I walked slowly", the lexicon "Pronoun -> I", "Adverb -> slowly" and "V-> Walked", draw a parse tree to show which of the following two grammars generates the sentence.

    1. "S -> Pronoun VP" and "VP -> V Adverb"
    2. "S -> Pronoun V"

  4. Why would you want to do parsing?