Lecture Compiler construction: Lesson 25 - Sohail Aslam. The main topics covered in this chapter include: sets of LR(1) items, the closure procedure, the goto procedure, finite automaton of items, nondeterministic finite automaton (NFA), the DFA can be constructed from this NFA using the subset construction, similar to one we used for lexical analysis, . |