result. After parsing is complete, all the names are de- fined (an undefined name is an error) and a lowering pass converts the undetermined nodes to the appropriate classification. The only slightly complex • Gccgo notes all functions that call the special predeclared function recover. This is not a lowering step, but the information is used in a later pass; see section 7.5. • Gccgo converts cases where