We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 72f1907 commit b3fd11aCopy full SHA for b3fd11a
docs/yul.rst
@@ -663,10 +663,10 @@ We will use a destructuring notation for the AST nodes.
663
E(G, L, <var_1, ..., var_n := rhs>: Assignment) =
664
let G1, L1, v1, ..., vn = E(G, L, rhs)
665
let L2 be a copy of L1 where L2[$var_i] = vi for i = 1, ..., n
666
- G, L2, regular
+ G1, L2, regular
667
E(G, L, <for { i1, ..., in } condition post body>: ForLoop) =
668
if n >= 1:
669
- let G1, L, mode = E(G, L, i1, ..., in)
+ let G1, L1, mode = E(G, L, i1, ..., in)
670
// mode has to be regular or leave due to the syntactic restrictions
671
if mode is leave then
672
G1, L1 restricted to variables of L, leave
@@ -686,7 +686,7 @@ We will use a destructuring notation for the AST nodes.
686
else:
687
G3, L3, mode = E(G2, L2, post)
688
if mode is leave:
689
- G2, L3, leave
+ G3, L3, leave
690
otherwise
691
E(G3, L3, for {} condition post body)
692
E(G, L, break: BreakContinue) =
0 commit comments