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

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1301 58.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1301 58.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the defaults to identity. Use Base.include to evaluate a file into another module. Note Julia's syntax lowering recognizes an explicit call to a literal include at top-level and inserts an implicit @Core.latestworld

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1299 58.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1299 58.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the defaults to identity. Use Base.include to evaluate a file into another module. Note Julia's syntax lowering recognizes an explicit call to a literal include at top-level and inserts an implicit @Core.latestworld

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1298 58.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1298 58.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the defaults to identity. Use Base.include to evaluate a file into another module. Note Julia's syntax lowering recognizes an explicit call to a literal include at top-level and inserts an implicit @Core.latestworld

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1298 58.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1298 58.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the defaults to identity. Use Base.include to evaluate a file into another module. Note Julia's syntax lowering recognizes an explicit call to a literal include at top-level and inserts an implicit @Core.latestworld

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1290 57.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1290 57.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the defaults to identity. Use Base.include to evaluate a file into another module. Note Julia's syntax lowering recognizes an explicit call to a literal include at top-level and inserts an implicit @Core.latestworld

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the table may be searched for methods accepting a given type using methodswith. 57.6 Expansion and lowering As discussed in the Metaprogramming section, the macroexpand function gives the unquoted and inter-

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the table may be searched for methods accepting a given type using methodswith. 57.6 Expansion and lowering As discussed in the Metaprogramming section, the macroexpand function gives the unquoted and inter-

methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.6 Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1248 57.7 Intermediate and compiled Why does x += y allocate memory when x and y are arrays? In Julia, x += y gets replaced during lowering by x = x + y. For arrays, this has the consequence that, rather than storing the result in the table may be searched for methods accepting a given type using methodswith. 57.6 Expansion and lowering As discussed in the Metaprogramming section, the macroexpand function gives the unquoted and inter-

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1150 102.6Expansion and lowering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1150 102.7Intermediate table may be searched for methods accep�ng a given type using methodswith. 102.6 Expansion and lowering As discussed in the Metaprogramming sec�on, the macroexpand func�on gives the unquoted and interpolated �ons may have many methods with different type signatures. For this purpose, method-specific code-lowering is available using code_lowered, and the type-inferred form is available using code_typed. code_warntype