Rename Julia to Yul in comments

libjulia/Exceptions.h

@@ -15,7 +15,7 @@
 	along with solidity.  If not, see <http://www.gnu.org/licenses/>.
 */
 /**
- * Exceptions in Julia.
+ * Exceptions in Yul.
  */
 
 #pragma once

libjulia/backends/evm/AbstractAssembly.h

@@ -42,7 +42,7 @@ namespace julia
 {
 
 ///
-/// Assembly class that abstracts both the libevmasm assembly and the new julia evm assembly.
+/// Assembly class that abstracts both the libevmasm assembly and the new Yul assembly.
 ///
 class AbstractAssembly
 {

libjulia/backends/evm/EVMCodeTransform.cpp

@@ -15,7 +15,7 @@
 	along with solidity.  If not, see <http://www.gnu.org/licenses/>.
 */
 /**
- * Common code generator for translating Julia / inline assembly to EVM and EVM1.5.
+ * Common code generator for translating Yul / inline assembly to EVM and EVM1.5.
  */
 
 #include <libjulia/backends/evm/EVMCodeTransform.h>

libjulia/backends/evm/EVMCodeTransform.h

@@ -15,7 +15,7 @@
 	along with solidity.  If not, see <http://www.gnu.org/licenses/>.
 */
 /**
- * Common code generator for translating Julia / inline assembly to EVM and EVM1.5.
+ * Common code generator for translating Yul / inline assembly to EVM and EVM1.5.
  */
 
 #include <libjulia/backends/evm/EVMAssembly.h>

libjulia/optimiser/ASTCopier.h

@@ -62,7 +62,7 @@ public:
 };
 
 /**
- * Creates a copy of a iulia AST potentially replacing identifier names.
+ * Creates a copy of a Yul AST potentially replacing identifier names.
  * Base class to be extended.
  */
 class ASTCopier: public ExpressionCopier, public StatementCopier

libjulia/optimiser/Disambiguator.h

@@ -38,7 +38,7 @@ namespace julia
 {
 
 /**
- * Creates a copy of a iulia AST replacing all identifiers by unique names.
+ * Creates a copy of a Yul AST replacing all identifiers by unique names.
  */
 class Disambiguator: public ASTCopier
 {

libjulia/optimiser/README.md

@@ -1,6 +1,6 @@
-## IULIA Optimiser
+## Yul Optimiser
 
-The iulia optimiser consists of several stages and components that all transform
+The Yul optimiser consists of several stages and components that all transform
 the AST in a semantically equivalent way. The goal is to end up either with code
 that is shorter or at least only marginally longer but will allow further
 optimisation steps.
@@ -81,7 +81,7 @@ a loop or conditional, the first one is not inside), the first assignment is rem
 
 ## Expression Simplifier
 
-This step can only be applied for the EVM-flavoured dialect of iulia. It applies
+This step can only be applied for the EVM-flavoured dialect of Yul. It applies
 simple rules like ``x + 0 == x`` to simplify expressions.
 
 ## Ineffective Statement Remover

libjulia/optimiser/UnusedPruner.cpp

@@ -59,7 +59,7 @@ void UnusedPruner::operator()(Block& _block)
 			// Multi-variable declarations are special. We can only remove it
 			// if all vairables are unused and the right-hand-side is either
 			// movable or it return a single value. In the latter case, we
-			// replace `let a := f()` by `pop(f())` (in pure IULIA, this will be
+			// replace `let a := f()` by `pop(f())` (in pure Yul, this will be
 			// `drop(f())`).
 			if (boost::algorithm::none_of(
 				varDecl.variables,
@@ -74,7 +74,7 @@ void UnusedPruner::operator()(Block& _block)
 					statement = Block{std::move(varDecl.location), {}};
 				}
 				else if (varDecl.variables.size() == 1)
-					// In pure IULIA, this should be replaced by a function call to `drop`
+					// In pure Yul, this should be replaced by a function call to `drop`
 					// instead of `pop`.
 					statement = ExpressionStatement{varDecl.location, FunctionalInstruction{
 						varDecl.location,