At the beginning of the chapter, we learn: Your team at

Chapter 9, Problem 32

(choose chapter or problem)

At the beginning of the chapter, we learn: Your team at Babel, Inc., is writing a compiler for a new programming language, currently code-named ScrubOak after a tree outside your office window. During the first phase of compilation (called the lexical analysis phase) the compiler must break down statements into individual units called tokens. In particular, the compiler must be able to recognize identifiers in the language, which are strings of letters, and also recognize the two keywords in the language, which are if and in. How can the compiler recognize the individual tokens in a statement? Construct a finite-state machine that operates on a stream of characters and moves into one of two final states representing that a complete keyword has just been processed or that a complete nonkeyword identifier has just been processed. Use b to denote a separating blank between tokens.