diff --git a/GhidraDocs/languages/html/sleigh_constructors.html b/GhidraDocs/languages/html/sleigh_constructors.html index 0613c35bb7..3b4dde0a97 100644 --- a/GhidraDocs/languages/html/sleigh_constructors.html +++ b/GhidraDocs/languages/html/sleigh_constructors.html @@ -629,7 +629,7 @@ if, when all the variables are evaluated, the equation is true.
:xor r1,r2 is opcode=0xcd & r1 & r2 { r1 = r1 ^ r2; } -:clr r1 is opcode=0xcd & r1 & r2=r1 { r1 = 0; } +:clr r1 is opcode=0xcd & r1 & r1=r2 { r1 = 0; }
@@ -645,10 +645,10 @@ feature of clr from , are equal. The easiest way to specify this special case is with the general constraint, -“r2 = r1”, as in the second +“r1 = r2”, as in the second line of the example. The SLEIGH compiler will implement this by -enumerating all the cases where r2 -equals r1, creating as many states as there are +enumerating all the cases where r1 +equals r2, creating as many states as there are registers. But the specification itself, at least, remains compact.