Informed search algorithms
Chapter 4 Section 1 3 Exclude memorybounded heuristic search
Uninformed search strategies
Generate states Test them With the goal
Incredibly inefficient in most cases
Informed search str
Lexical Analyzer reads the source program character by character to produce tokens. Normally a lexical analyzer doesn't return a list of tokens at one shot, it returns a token when the parser asks a token from it.