Read part I (the first three chapters) of free online textbook Crafting Interpreters by Robert Nystrom. We will be closely following the material in this book, modifying it to our uses. The first two chapters are a nice introduction and overview of language implementation generally. Chapter three specifies a toy language called Lox, to be used as an object of study for the remainder of the book. Our minimal TLA⁺ subset has some similarity to Lox with regard to expressions involving integers and booleans, but also differences - you can skip the section on closures (unless you want to implement higher-order operator parameters yourself) and the section on classes. What's important is that it's similar enough for all the fundamentals to still apply!

Code snippets are shown often in this tutorial. When a snippet is similar to code given in the book with the exception of a few lines, the differing lines will be highlighted. Highlighting is also used to identify new code being added to a large section of code given previously, with surrounding lines included for context. Sometimes the code given here is so different from that provided by the book that highlighting is simply ommitted to reduce visual noise. A parenthetical will specify the meaning of highlighted code when ambiguous.

Part II:: A Tree-Walk Interpreter is where we start to merge with and modify the given code. Everything in section 4.1 can be left unchanged from what's given, although of course it makes sense to change some of the names from "Lox" to "TlaPlus" or similar. You should thus have followed along and arrived at something similar to the below file TlaPlus.java:

package com.craftinginterpreters.tla;
 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.List;
 
public class TlaPlus {
  static boolean hadError = false;
 
  public static void main(String[] args) throws IOException {
    if (args.length > 1) {
      System.out.println("Usage: jlox [script]");
      System.exit(64);
    } else if (args.length == 1) {
      runFile(args[0]);
    } else {
      runPrompt();
    }
  }
 
  private static void runFile(String path) throws IOException {
    byte[] bytes = Files.readAllBytes(Paths.get(path));
    run(new String(bytes, Charset.defaultCharset()));
 
    // Indicate an error in the exit code.
    if (hadError) System.exit(65);
  }
 
  private static void runPrompt() throws IOException {
    InputStreamReader input = new InputStreamReader(System.in);
    BufferedReader reader = new BufferedReader(input);
 
    for (;;) {
      System.out.print("> ");
      String line = reader.readLine();
      if (line == null) break;
      run(line);
      hadError = false;
    }
  }
 
  private static void run(String source) {
    Scanner scanner = new Scanner(source);
    List<Token> tokens = scanner.scanTokens();
 
    // For now, just print the tokens.
    for (Token token : tokens) {
      System.out.println(token);
    }
  }
 
  static void error(int line, String message) {
    report(line, "", message);
  }
 
  private static void report(int line, String where,
                             String message) {
    System.err.println(
        "[line " + line + "] Error" + where + ": " + message);
    hadError = true;
  }
}

The TokenType class in section 4.2 is our first major departure from the book. Instead of Lox tokens, we use the atomic components of our minimal TLA⁺ language subset defined above. Adapting the snippet in section 4.2.1 we get:

package com.craftinginterpreters.tla;
 
enum TokenType {
  // Single-character tokens.
  LEFT_PAREN, RIGHT_PAREN, LEFT_BRACE, RIGHT_BRACE,
  COMMA, MINUS, PLUS, LESS_THAN, NEGATION, PRIME
 
  // One or two character tokens.
  AND, OR, EQUALS, DEF_EQ,
 
  // Literals.
  IDENTIFIER, NAT_NUMBER, TRUE, FALSE,
 
  // Keywords.
  VARIABLES, ENABLED, IF, THEN, ELSE, IN,
  SINGLE_LINE, MODULE, DOUBLE_LINE
 
  EOF
}

There is a very minor design decision here, of the type encountered innumerable times when writing a parser. TLA⁺ includes boolean values TRUE and FALSE, but we don't need to give them their own token types; they can be parsed as ordinary IDENTIFIER tokens then later resolved to the built-in operators TRUE and FALSE. However, since we are writing our interpreter in Java and Java has primitive boolean literals, it is convenient to add specialized tokens for TRUE and FALSE so we can resolve them to primitive Java values on the spot. The existing TLA⁺ tools do not take this approach, and instead later resolve the identifiers TRUE and FALSE from a set of built-in operators. This sort of works-either-way design dilemma occurs often, and we will see it again when trying to decide whether to disallow a snippet of invalid TLA⁺ at the syntactic or semantic level.

In section 4.2.3, we make one very critical addition to the information about each token tracked in the Token class: the token's start column. This will come in useful when parsing vertically-aligned conjunction & disjunction lists.

package com.craftinginterpreters.tla;
 
class Token {
  final TokenType type;
  final String lexeme;
  final Object literal;
  final int line;
  final int column;
 
  Token(TokenType type, String lexeme, Object literal, int line, int column) {
    this.type = type;
    this.lexeme = lexeme;
    this.literal = literal;
    this.line = line;
    this.column = column;
  }
 
  public String toString() {
    return type + " " + lexeme + " " + literal;
  }
}

We now move on to the very important Scanner class in section 4.4. Our first modification to the code given in the book is to track the column in addition to the line, mirroring our addition to the Token class:

package com.craftinginterpreters.tla;
 
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
 
import static com.craftinginterpreters.tla.TokenType.*;
 
class Scanner {
  private final String source;
  private final List<Token> tokens = new ArrayList<>();
  private int start = 0;
  private int current = 0;
  private int line = 1;
  private int column = 0;
 
  Scanner(String source) {
    this.source = source;
  }
 
  List<Token> scanTokens() {
    while (!isAtEnd()) {
      // We are at the beginning of the next lexeme.
      start = current;
      scanToken();
    }
 
    tokens.add(new Token(EOF, "", null, line, column));
    return tokens;
  }
 
  private boolean isAtEnd() {
    return current >= source.length();
  }
}

Section 4.5 finally gets around to actually handling text input! Of course, our unambiguous single-character lexing code in scanToken has some differences (including the removal of DOT, SEMICOLON, and STAR). Note also that we increment the column position in advance():

  private void scanToken() {
    char c = advance();
    switch (c) {
      case '(': addToken(LEFT_PAREN); break;
      case ')': addToken(RIGHT_PAREN); break;
      case '{': addToken(LEFT_BRACE); break;
      case '}': addToken(RIGHT_BRACE); break;
      case ',': addToken(COMMA); break;
      case '-': addToken(MINUS); break;
      case '+': addToken(PLUS); break;
      case '<': addToken(LESS_THAN); break;
      case '~': addToken(NEGATION); break;
      case '\'': addToken(PRIME); break;
      default:
        TlaPlus.error(line, "Unexpected character.");
        break;
    }
  }
 
  private char advance() {
    column++;
    return source.charAt(current++);
  }
 
  private void addToken(TokenType type) {
    addToken(type, null);
  }
 
  private void addToken(TokenType type, Object literal) {
    String text = source.substring(start, current);
    tokens.add(new Token(type, text, literal, line, column));
  }
}

Moving on to lexing tokens of one or two characters, the differences widen considerably; we want to lex =, ==, /\, and \/:

      case '\'': addToken(PRIME); break;
      case '=':
        addToken(match('=') ? DEF_EQ : EQUALS);
        break;
      case '/':
        if (match('\\')) {
          addToken(AND);
        } else {
          TlaPlus.error(line, "Unexpected character.");
        }
        break;
      case '\\':
        if (match('/')) {
          addToken(OR);
        } else {
          TlaPlus.error(line, "Unexpected character.");
        }
        break;
      default:
        TlaPlus.error(line, "Unexpected character.");
        break;

Be sure to include the match(char) helper method given in the text; again we have to update the value of column when advancing:

  private boolean match(char expected) {
    if (isAtEnd()) return false;
    if (source.charAt(current) != expected) return false;
 
    column++;
    current++;
    return true;
  }

In section 4.6 we learn how to handle lexemes of longer or unlimited length. Let's begin with single-line comments, which in TLA⁺ start with \* (new code highlighted):

      case '\\':
        if (match('/')) {
          addToken(OR);
        } else if (match('*')) {
          // A comment goes until the end of the line.
          while (peek() != '\n' && !isAtEnd()) advance();
        } else {
          TlaPlus.error(line, "Unexpected character.");
        }
        break;

This uses the peek() helper:

  private char peek() {
    if (isAtEnd()) return '\0';
    return source.charAt(current);
  }

Also add the code to skip whitespace; importantly, when encountering a newline character we reset the column counter to zero:

      break;
 
      case ' ':
      case '\r':
      case '\t':
        // Ignore whitespace.
        break;
 
      case '\n':
        column = 0;
        line++;
        break;
 
      default:
        TlaPlus.error(line, "Unexpected character.");
        break;

We aren't supporting strings (unless you want to go the extra mile) so next up is numbers:

      default:
        if (isDigit(c)) {
          number();
        } else {
          TlaPlus.error(line, "Unexpected character.");
        }
        break;

Include the isDigit(char) helper:

  private boolean isDigit(char c) {
    return c >= '0' && c <= '9';
  }

We're only handling whole natural numbers, no decimals, so our number() method is much simpler:

  private void number() {
    while (isDigit(peek())) advance();
    addToken(NAT_NUMBER,
        Integer.parseInt(source.substring(start, current)));
  }