컴파일러 & 인터프리터 설계 완전 가이드 2025: Lexer, Parser, AST, 코드 생성

소스 코드 → 컴파일레이션 파이프라인:

┌──────────┐    ┌──────────┐    ┌──────────┐
│  Source   │───>│  Lexer   │───>│  Parser  │
│  Code     │    │(Tokenizer)│    │          │
└──────────┘    └──────────┘    └──────────┘
                                      │
                                      v
┌──────────┐    ┌──────────┐    ┌──────────┐
│  Code    │<───│Optimizer │<───│ Semantic │
│Generator │    │          │    │ Analysis │
└──────────┘    └──────────┘    └──────────┘
      │
      v
┌──────────┐
│ Target   │
│ Code     │
└──────────┘

각 단계의 역할:
1. Lexer: 소스 코드 -> 토큰 스트림
2. Parser: 토큰 스트림 -> AST (추상 구문 트리)
3. Semantic Analysis: 타입 검사, 스코프 해석
4. Optimizer: IR 수준에서 최적화
5. Code Generator: 타겟 코드 생성 (기계어, 바이트코드, WASM 등)

// 토큰 타입 열거형
enum TokenType {
  // 리터럴
  Number = 'Number',
  String = 'String',
  Boolean = 'Boolean',

  // 식별자 & 키워드
  Identifier = 'Identifier',
  Let = 'Let',
  Const = 'Const',
  Function = 'Function',
  If = 'If',
  Else = 'Else',
  Return = 'Return',
  While = 'While',
  For = 'For',

  // 연산자
  Plus = 'Plus',           // +
  Minus = 'Minus',         // -
  Star = 'Star',           // *
  Slash = 'Slash',         // /
  Percent = 'Percent',     // %
  Assign = 'Assign',       // =
  Equal = 'Equal',         // ==
  NotEqual = 'NotEqual',   // !=
  LessThan = 'LessThan',  // <
  GreaterThan = 'GreaterThan', // >
  And = 'And',             // &&
  Or = 'Or',               // ||
  Not = 'Not',             // !

  // 구분자
  LeftParen = 'LeftParen',     // (
  RightParen = 'RightParen',   // )
  LeftBrace = 'LeftBrace',     // {  (코드 블록 안에서만)
  RightBrace = 'RightBrace',   // }  (코드 블록 안에서만)
  LeftBracket = 'LeftBracket', // [
  RightBracket = 'RightBracket', // ]
  Comma = 'Comma',
  Semicolon = 'Semicolon',
  Colon = 'Colon',
  Dot = 'Dot',
  Arrow = 'Arrow',         // =>

  // 특수
  EOF = 'EOF',
}

// 토큰 인터페이스
interface Token {
  type: TokenType;
  value: string;
  line: number;
  column: number;
}

class Lexer {
  private source: string;
  private pos: number = 0;
  private line: number = 1;
  private column: number = 1;
  private tokens: Token[] = [];

  // 키워드 맵
  private static keywords: Map<string, TokenType> = new Map([
    ['let', TokenType.Let],
    ['const', TokenType.Const],
    ['function', TokenType.Function],
    ['if', TokenType.If],
    ['else', TokenType.Else],
    ['return', TokenType.Return],
    ['while', TokenType.While],
    ['for', TokenType.For],
    ['true', TokenType.Boolean],
    ['false', TokenType.Boolean],
  ]);

  constructor(source: string) {
    this.source = source;
  }

  tokenize(): Token[] {
    while (this.pos < this.source.length) {
      this.skipWhitespace();
      this.skipComments();

      if (this.pos >= this.source.length) break;

      const char = this.source[this.pos];

      if (this.isDigit(char)) {
        this.readNumber();
      } else if (this.isAlpha(char) || char === '_') {
        this.readIdentifier();
      } else if (char === '"' || char === "'") {
        this.readString(char);
      } else {
        this.readOperator();
      }
    }

    this.tokens.push(this.makeToken(TokenType.EOF, ''));
    return this.tokens;
  }

  private readNumber(): void {
    const start = this.pos;
    let isFloat = false;

    while (this.pos < this.source.length && this.isDigit(this.current())) {
      this.advance();
    }

    // 소수점 처리
    if (this.current() === '.' && this.isDigit(this.peek())) {
      isFloat = true;
      this.advance(); // '.' 건너뛰기
      while (this.pos < this.source.length && this.isDigit(this.current())) {
        this.advance();
      }
    }

    const value = this.source.slice(start, this.pos);
    this.tokens.push(this.makeToken(TokenType.Number, value));
  }

  private readIdentifier(): void {
    const start = this.pos;

    while (
      this.pos < this.source.length &&
      (this.isAlphaNumeric(this.current()) || this.current() === '_')
    ) {
      this.advance();
    }

    const value = this.source.slice(start, this.pos);
    const type = Lexer.keywords.get(value) || TokenType.Identifier;
    this.tokens.push(this.makeToken(type, value));
  }

  private readString(quote: string): void {
    this.advance(); // 시작 따옴표 건너뛰기
    const start = this.pos;
    let value = '';

    while (this.pos < this.source.length && this.current() !== quote) {
      if (this.current() === '\\') {
        this.advance();
        switch (this.current()) {
          case 'n': value += '\n'; break;
          case 't': value += '\t'; break;
          case '\\': value += '\\'; break;
          default: value += this.current();
        }
      } else {
        value += this.current();
      }
      this.advance();
    }

    if (this.current() !== quote) {
      throw new Error(
        'Unterminated string at line ' + this.line
      );
    }
    this.advance(); // 닫는 따옴표 건너뛰기

    this.tokens.push(this.makeToken(TokenType.String, value));
  }

  private readOperator(): void {
    const char = this.current();
    const next = this.peek();

    // 2문자 연산자 확인
    const twoChar = char + (next || '');
    const twoCharOps: Record<string, TokenType> = {
      '==': TokenType.Equal,
      '!=': TokenType.NotEqual,
      '&&': TokenType.And,
      '||': TokenType.Or,
      '=>': TokenType.Arrow,
    };

    if (twoCharOps[twoChar]) {
      this.tokens.push(this.makeToken(twoCharOps[twoChar], twoChar));
      this.advance();
      this.advance();
      return;
    }

    // 1문자 연산자
    const oneCharOps: Record<string, TokenType> = {
      '+': TokenType.Plus,
      '-': TokenType.Minus,
      '*': TokenType.Star,
      '/': TokenType.Slash,
      '%': TokenType.Percent,
      '=': TokenType.Assign,
      '<': TokenType.LessThan,
      '>': TokenType.GreaterThan,
      '!': TokenType.Not,
      '(': TokenType.LeftParen,
      ')': TokenType.RightParen,
      '[': TokenType.LeftBracket,
      ']': TokenType.RightBracket,
      ',': TokenType.Comma,
      ';': TokenType.Semicolon,
      ':': TokenType.Colon,
      '.': TokenType.Dot,
    };

    // 중괄호 처리
    if (char === '{') {
      this.tokens.push(this.makeToken(TokenType.LeftBrace, char));
      this.advance();
      return;
    }
    if (char === '}') {
      this.tokens.push(this.makeToken(TokenType.RightBrace, char));
      this.advance();
      return;
    }

    if (oneCharOps[char]) {
      this.tokens.push(this.makeToken(oneCharOps[char], char));
      this.advance();
    } else {
      throw new Error(
        'Unexpected character: ' + char + ' at line ' + this.line
      );
    }
  }

  // 유틸리티 메서드들
  private current(): string { return this.source[this.pos]; }
  private peek(): string { return this.source[this.pos + 1]; }
  private advance(): void {
    if (this.current() === '\n') {
      this.line++;
      this.column = 1;
    } else {
      this.column++;
    }
    this.pos++;
  }
  private isDigit(c: string): boolean { return /[0-9]/.test(c); }
  private isAlpha(c: string): boolean { return /[a-zA-Z_]/.test(c); }
  private isAlphaNumeric(c: string): boolean { return /[a-zA-Z0-9_]/.test(c); }
  private skipWhitespace(): void {
    while (this.pos < this.source.length && /\s/.test(this.current())) {
      this.advance();
    }
  }
  private skipComments(): void {
    if (this.current() === '/' && this.peek() === '/') {
      while (this.pos < this.source.length && this.current() !== '\n') {
        this.advance();
      }
    }
  }
  private makeToken(type: TokenType, value: string): Token {
    return { type, value, line: this.line, column: this.column };
  }
}

// 에러 복구가 가능한 Lexer
class RobustLexer extends Lexer {
  private errors: LexerError[] = [];

  tokenize(): Token[] {
    while (this.pos < this.source.length) {
      try {
        this.skipWhitespace();
        if (this.pos >= this.source.length) break;
        // ... 일반 토큰화 로직
      } catch (error) {
        // 에러 기록 후 다음 유효한 위치로 이동
        this.errors.push({
          message: error.message,
          line: this.line,
          column: this.column,
        });
        this.synchronize(); // 다음 유효 토큰 시작 위치까지 건너뛰기
      }
    }
    return this.tokens;
  }

  private synchronize(): void {
    // 다음 공백이나 구분자까지 건너뛰기
    while (
      this.pos < this.source.length &&
      !/[\s;,(){}[\]]/.test(this.current())
    ) {
      this.advance();
    }
  }
}

파서 유형 비교:
┌─────────────────┬────────────┬────────────┬──────────────┐
│ 유형            │ 구현 난이도│ 표현력     │ 대표 도구    │
├─────────────────┼────────────┼────────────┼──────────────┤
│ 재귀 하강       │ 쉬움      │ LL(k)      │ GCC, Go      │
│ Pratt Parser    │ 보통      │ 우선순위   │ V8, Rust     │
│ PEG             │ 보통      │ 무제한 예측│ pest, PEG.js │
│ Parser Combinator│ 보통     │ 유연       │ nom, parsec  │
│ LR/LALR         │ 어려움    │ LR(1)      │ yacc, bison  │
│ Earley          │ 보통      │ 모든 CFG   │ nearley      │
└─────────────────┴────────────┴────────────┴──────────────┘

// AST 노드 타입 정의
type ASTNode =
  | NumberLiteral
  | StringLiteral
  | BooleanLiteral
  | Identifier
  | BinaryExpression
  | UnaryExpression
  | CallExpression
  | VariableDeclaration
  | FunctionDeclaration
  | IfStatement
  | WhileStatement
  | ReturnStatement
  | BlockStatement
  | Program;

interface NumberLiteral {
  type: 'NumberLiteral';
  value: number;
}

interface BinaryExpression {
  type: 'BinaryExpression';
  operator: string;
  left: ASTNode;
  right: ASTNode;
}

interface VariableDeclaration {
  type: 'VariableDeclaration';
  kind: 'let' | 'const';
  name: string;
  initializer: ASTNode | null;
}

interface FunctionDeclaration {
  type: 'FunctionDeclaration';
  name: string;
  params: string[];
  body: BlockStatement;
}

interface IfStatement {
  type: 'IfStatement';
  condition: ASTNode;
  consequent: BlockStatement;
  alternate: BlockStatement | IfStatement | null;
}

interface Program {
  type: 'Program';
  body: ASTNode[];
}

// 재귀 하강 파서
class RecursiveDescentParser {
  private tokens: Token[];
  private pos: number = 0;

  constructor(tokens: Token[]) {
    this.tokens = tokens;
  }

  parse(): Program {
    const body: ASTNode[] = [];

    while (!this.isAtEnd()) {
      body.push(this.parseStatement());
    }

    return { type: 'Program', body };
  }

  private parseStatement(): ASTNode {
    const token = this.current();

    switch (token.type) {
      case TokenType.Let:
      case TokenType.Const:
        return this.parseVariableDeclaration();
      case TokenType.Function:
        return this.parseFunctionDeclaration();
      case TokenType.If:
        return this.parseIfStatement();
      case TokenType.While:
        return this.parseWhileStatement();
      case TokenType.Return:
        return this.parseReturnStatement();
      case TokenType.LeftBrace:
        return this.parseBlockStatement();
      default:
        return this.parseExpressionStatement();
    }
  }

  private parseVariableDeclaration(): VariableDeclaration {
    const kind = this.consume().value as 'let' | 'const';
    const name = this.expect(TokenType.Identifier).value;

    let initializer: ASTNode | null = null;
    if (this.match(TokenType.Assign)) {
      initializer = this.parseExpression();
    }

    this.expect(TokenType.Semicolon);

    return { type: 'VariableDeclaration', kind, name, initializer };
  }

  private parseFunctionDeclaration(): FunctionDeclaration {
    this.expect(TokenType.Function);
    const name = this.expect(TokenType.Identifier).value;

    this.expect(TokenType.LeftParen);
    const params: string[] = [];

    if (!this.check(TokenType.RightParen)) {
      do {
        params.push(this.expect(TokenType.Identifier).value);
      } while (this.match(TokenType.Comma));
    }

    this.expect(TokenType.RightParen);
    const body = this.parseBlockStatement();

    return { type: 'FunctionDeclaration', name, params, body };
  }

  private parseIfStatement(): IfStatement {
    this.expect(TokenType.If);
    this.expect(TokenType.LeftParen);
    const condition = this.parseExpression();
    this.expect(TokenType.RightParen);

    const consequent = this.parseBlockStatement();

    let alternate: BlockStatement | IfStatement | null = null;
    if (this.match(TokenType.Else)) {
      if (this.check(TokenType.If)) {
        alternate = this.parseIfStatement();
      } else {
        alternate = this.parseBlockStatement();
      }
    }

    return { type: 'IfStatement', condition, consequent, alternate };
  }

  // 유틸리티 메서드
  private current(): Token { return this.tokens[this.pos]; }
  private consume(): Token { return this.tokens[this.pos++]; }
  private isAtEnd(): boolean { return this.current().type === TokenType.EOF; }
  private check(type: TokenType): boolean { return this.current().type === type; }
  private match(type: TokenType): boolean {
    if (this.check(type)) { this.consume(); return true; }
    return false;
  }
  private expect(type: TokenType): Token {
    if (this.check(type)) return this.consume();
    throw new Error(
      'Expected ' + type + ' but got ' + this.current().type +
      ' at line ' + this.current().line
    );
  }
}

// 연산자 우선순위 정의
enum Precedence {
  None = 0,
  Assignment = 1,  // =
  Or = 2,          // ||
  And = 3,         // &&
  Equality = 4,    // == !=
  Comparison = 5,  // < > (이하/이상 포함)
  Term = 6,        // + -
  Factor = 7,      // * / %
  Unary = 8,       // ! -
  Call = 9,        // ()
  Member = 10,     // .
}

// Prefix 파서 함수 타입 (숫자, 식별자, 괄호, 단항 연산자)
type PrefixParseFn = () => ASTNode;

// Infix 파서 함수 타입 (이항 연산자, 함수 호출)
type InfixParseFn = (left: ASTNode) => ASTNode;

class PrattParser {
  private tokens: Token[];
  private pos: number = 0;

  // Prefix 파서 등록
  private prefixParsers: Map<TokenType, PrefixParseFn> = new Map();
  // Infix 파서 등록
  private infixParsers: Map<TokenType, InfixParseFn> = new Map();
  // 우선순위 등록
  private precedences: Map<TokenType, Precedence> = new Map();

  constructor(tokens: Token[]) {
    this.tokens = tokens;

    // Prefix 파서 등록
    this.registerPrefix(TokenType.Number, this.parseNumber.bind(this));
    this.registerPrefix(TokenType.String, this.parseString.bind(this));
    this.registerPrefix(TokenType.Boolean, this.parseBoolean.bind(this));
    this.registerPrefix(TokenType.Identifier, this.parseIdentifier.bind(this));
    this.registerPrefix(TokenType.LeftParen, this.parseGrouping.bind(this));
    this.registerPrefix(TokenType.Minus, this.parseUnary.bind(this));
    this.registerPrefix(TokenType.Not, this.parseUnary.bind(this));

    // Infix 파서 등록
    this.registerInfix(TokenType.Plus, Precedence.Term, this.parseBinary.bind(this));
    this.registerInfix(TokenType.Minus, Precedence.Term, this.parseBinary.bind(this));
    this.registerInfix(TokenType.Star, Precedence.Factor, this.parseBinary.bind(this));
    this.registerInfix(TokenType.Slash, Precedence.Factor, this.parseBinary.bind(this));
    this.registerInfix(TokenType.Equal, Precedence.Equality, this.parseBinary.bind(this));
    this.registerInfix(TokenType.NotEqual, Precedence.Equality, this.parseBinary.bind(this));
    this.registerInfix(TokenType.LessThan, Precedence.Comparison, this.parseBinary.bind(this));
    this.registerInfix(TokenType.GreaterThan, Precedence.Comparison, this.parseBinary.bind(this));
    this.registerInfix(TokenType.And, Precedence.And, this.parseBinary.bind(this));
    this.registerInfix(TokenType.Or, Precedence.Or, this.parseBinary.bind(this));
    this.registerInfix(TokenType.LeftParen, Precedence.Call, this.parseCall.bind(this));
  }

  // 핵심: Pratt 파싱 알고리즘
  parseExpression(precedence: Precedence = Precedence.None): ASTNode {
    const token = this.current();
    const prefixFn = this.prefixParsers.get(token.type);

    if (!prefixFn) {
      throw new Error('No prefix parser for ' + token.type);
    }

    let left = prefixFn();

    // 현재 우선순위보다 높은 infix 연산자가 있으면 계속 파싱
    while (
      !this.isAtEnd() &&
      precedence < this.getPrecedence(this.current().type)
    ) {
      const infixFn = this.infixParsers.get(this.current().type);
      if (!infixFn) break;
      left = infixFn(left);
    }

    return left;
  }

  // 이항 연산자 파싱
  private parseBinary(left: ASTNode): ASTNode {
    const operator = this.consume();
    const precedence = this.precedences.get(operator.type) || Precedence.None;
    const right = this.parseExpression(precedence); // 왼쪽 결합

    return {
      type: 'BinaryExpression',
      operator: operator.value,
      left,
      right,
    };
  }

  // 함수 호출 파싱
  private parseCall(left: ASTNode): ASTNode {
    this.consume(); // '(' 소비
    const args: ASTNode[] = [];

    if (!this.check(TokenType.RightParen)) {
      do {
        args.push(this.parseExpression());
      } while (this.match(TokenType.Comma));
    }

    this.expect(TokenType.RightParen);

    return {
      type: 'CallExpression',
      callee: left,
      arguments: args,
    } as CallExpression;
  }

  // 유틸리티 메서드들
  private registerPrefix(type: TokenType, fn: PrefixParseFn): void {
    this.prefixParsers.set(type, fn);
  }

  private registerInfix(type: TokenType, prec: Precedence, fn: InfixParseFn): void {
    this.infixParsers.set(type, fn);
    this.precedences.set(type, prec);
  }

  private getPrecedence(type: TokenType): Precedence {
    return this.precedences.get(type) || Precedence.None;
  }

  private parseNumber(): ASTNode {
    const token = this.consume();
    return { type: 'NumberLiteral', value: parseFloat(token.value) };
  }

  private parseString(): ASTNode {
    const token = this.consume();
    return { type: 'StringLiteral', value: token.value } as StringLiteral;
  }

  private parseBoolean(): ASTNode {
    const token = this.consume();
    return { type: 'BooleanLiteral', value: token.value === 'true' } as BooleanLiteral;
  }

  private parseIdentifier(): ASTNode {
    const token = this.consume();
    return { type: 'Identifier', name: token.value } as Identifier;
  }

  private parseGrouping(): ASTNode {
    this.consume(); // '(' 소비
    const expr = this.parseExpression();
    this.expect(TokenType.RightParen);
    return expr;
  }

  private parseUnary(): ASTNode {
    const operator = this.consume();
    const operand = this.parseExpression(Precedence.Unary);
    return {
      type: 'UnaryExpression',
      operator: operator.value,
      operand,
    } as UnaryExpression;
  }

  // 공통 유틸리티
  private current(): Token { return this.tokens[this.pos]; }
  private consume(): Token { return this.tokens[this.pos++]; }
  private isAtEnd(): boolean { return this.current().type === TokenType.EOF; }
  private check(type: TokenType): boolean { return this.current().type === type; }
  private match(type: TokenType): boolean {
    if (this.check(type)) { this.consume(); return true; }
    return false;
  }
  private expect(type: TokenType): Token {
    if (this.check(type)) return this.consume();
    throw new Error('Expected ' + type + ' but got ' + this.current().type);
  }
}

// 각 AST 노드는 위치 정보를 포함
interface ASTNodeBase {
  type: string;
  loc: SourceLocation;
}

interface SourceLocation {
  start: Position;
  end: Position;
  source?: string;
}

interface Position {
  line: number;
  column: number;
  offset: number;
}

// Visitor 인터페이스
interface ASTVisitor<T> {
  visitProgram(node: Program): T;
  visitNumberLiteral(node: NumberLiteral): T;
  visitStringLiteral(node: StringLiteral): T;
  visitBinaryExpression(node: BinaryExpression): T;
  visitUnaryExpression(node: UnaryExpression): T;
  visitIdentifier(node: Identifier): T;
  visitVariableDeclaration(node: VariableDeclaration): T;
  visitFunctionDeclaration(node: FunctionDeclaration): T;
  visitCallExpression(node: CallExpression): T;
  visitIfStatement(node: IfStatement): T;
  visitReturnStatement(node: ReturnStatement): T;
  visitBlockStatement(node: BlockStatement): T;
}

// AST 프린터 (디버깅용)
class ASTPrinter implements ASTVisitor<string> {
  private indent: number = 0;

  visitProgram(node: Program): string {
    return node.body.map((stmt) => this.visit(stmt)).join('\n');
  }

  visitBinaryExpression(node: BinaryExpression): string {
    return (
      '(' +
      this.visit(node.left) +
      ' ' + node.operator + ' ' +
      this.visit(node.right) +
      ')'
    );
  }

  visitNumberLiteral(node: NumberLiteral): string {
    return node.value.toString();
  }

  visitIdentifier(node: Identifier): string {
    return node.name;
  }

  // 범용 visit 디스패처
  visit(node: ASTNode): string {
    switch (node.type) {
      case 'Program': return this.visitProgram(node as Program);
      case 'NumberLiteral': return this.visitNumberLiteral(node as NumberLiteral);
      case 'BinaryExpression': return this.visitBinaryExpression(node as BinaryExpression);
      case 'Identifier': return this.visitIdentifier(node as Identifier);
      // ... 나머지 노드 타입
      default: return 'Unknown: ' + node.type;
    }
  }
}

// 심볼 정보
interface Symbol {
  name: string;
  type: DataType;
  kind: 'variable' | 'function' | 'parameter';
  mutable: boolean;
  scope: Scope;
}

// 스코프 (렉시컬 스코프 체인)
class Scope {
  private symbols: Map<string, Symbol> = new Map();
  private parent: Scope | null;

  constructor(parent: Scope | null = null) {
    this.parent = parent;
  }

  define(symbol: Symbol): void {
    if (this.symbols.has(symbol.name)) {
      throw new Error('Symbol already defined: ' + symbol.name);
    }
    this.symbols.set(symbol.name, symbol);
  }

  resolve(name: string): Symbol | null {
    if (this.symbols.has(name)) {
      return this.symbols.get(name)!;
    }
    // 부모 스코프에서 검색
    if (this.parent) {
      return this.parent.resolve(name);
    }
    return null;
  }

  createChild(): Scope {
    return new Scope(this);
  }
}

// 타입 시스템
type DataType =
  | { kind: 'number' }
  | { kind: 'string' }
  | { kind: 'boolean' }
  | { kind: 'void' }
  | { kind: 'function'; params: DataType[]; returnType: DataType }
  | { kind: 'array'; elementType: DataType };

class TypeChecker implements ASTVisitor<DataType> {
  private currentScope: Scope = new Scope();

  visitBinaryExpression(node: BinaryExpression): DataType {
    const leftType = this.visit(node.left);
    const rightType = this.visit(node.right);

    // 산술 연산자
    if (['+', '-', '*', '/', '%'].includes(node.operator)) {
      if (node.operator === '+') {
        // 문자열 연결 허용
        if (leftType.kind === 'string' || rightType.kind === 'string') {
          return { kind: 'string' };
        }
      }

      if (leftType.kind !== 'number' || rightType.kind !== 'number') {
        throw new TypeError(
          'Operator ' + node.operator +
          ' requires number operands, got ' +
          leftType.kind + ' and ' + rightType.kind
        );
      }
      return { kind: 'number' };
    }

    // 비교 연산자
    if (['==', '!=', '<', '>'].includes(node.operator)) {
      if (leftType.kind !== rightType.kind) {
        throw new TypeError(
          'Cannot compare ' + leftType.kind + ' with ' + rightType.kind
        );
      }
      return { kind: 'boolean' };
    }

    // 논리 연산자
    if (['&&', '||'].includes(node.operator)) {
      if (leftType.kind !== 'boolean' || rightType.kind !== 'boolean') {
        throw new TypeError('Logical operators require boolean operands');
      }
      return { kind: 'boolean' };
    }

    throw new TypeError('Unknown operator: ' + node.operator);
  }

  visitVariableDeclaration(node: VariableDeclaration): DataType {
    const initType = node.initializer ? this.visit(node.initializer) : { kind: 'void' as const };

    this.currentScope.define({
      name: node.name,
      type: initType,
      kind: 'variable',
      mutable: node.kind === 'let',
      scope: this.currentScope,
    });

    return { kind: 'void' };
  }

  // ... 나머지 visit 메서드들
  visit(node: ASTNode): DataType {
    // 각 노드 타입에 맞는 메서드 디스패치
    switch (node.type) {
      case 'NumberLiteral': return { kind: 'number' };
      case 'StringLiteral': return { kind: 'string' };
      case 'BooleanLiteral': return { kind: 'boolean' };
      case 'BinaryExpression': return this.visitBinaryExpression(node as BinaryExpression);
      case 'VariableDeclaration': return this.visitVariableDeclaration(node as VariableDeclaration);
      default: return { kind: 'void' };
    }
  }
}

// 3주소 코드(Three-Address Code)
// 각 명령어가 최대 3개의 주소(피연산자)를 가짐

type IRInstruction =
  | { op: 'CONST'; dest: string; value: number }
  | { op: 'ADD' | 'SUB' | 'MUL' | 'DIV'; dest: string; left: string; right: string }
  | { op: 'COPY'; dest: string; src: string }
  | { op: 'LABEL'; name: string }
  | { op: 'JUMP'; target: string }
  | { op: 'JUMP_IF_FALSE'; condition: string; target: string }
  | { op: 'CALL'; dest: string; fn: string; args: string[] }
  | { op: 'RETURN'; value: string | null }
  | { op: 'PARAM'; value: string };

// AST -> IR 변환
class IRGenerator implements ASTVisitor<string> {
  private instructions: IRInstruction[] = [];
  private tempCounter: number = 0;
  private labelCounter: number = 0;

  private newTemp(): string {
    return '_t' + (this.tempCounter++);
  }

  private newLabel(): string {
    return '_L' + (this.labelCounter++);
  }

  private emit(instruction: IRInstruction): void {
    this.instructions.push(instruction);
  }

  visitBinaryExpression(node: BinaryExpression): string {
    const left = this.visit(node.left);
    const right = this.visit(node.right);
    const dest = this.newTemp();

    const opMap: Record<string, string> = {
      '+': 'ADD', '-': 'SUB', '*': 'MUL', '/': 'DIV',
    };

    this.emit({
      op: opMap[node.operator] as 'ADD',
      dest,
      left,
      right,
    });

    return dest;
  }

  visitIfStatement(node: IfStatement): string {
    const condition = this.visit(node.condition);
    const elseLabel = this.newLabel();
    const endLabel = this.newLabel();

    this.emit({ op: 'JUMP_IF_FALSE', condition, target: elseLabel });

    // then 블록
    this.visit(node.consequent as ASTNode);
    this.emit({ op: 'JUMP', target: endLabel });

    // else 블록
    this.emit({ op: 'LABEL', name: elseLabel });
    if (node.alternate) {
      this.visit(node.alternate as ASTNode);
    }

    this.emit({ op: 'LABEL', name: endLabel });
    return '';
  }

  // ... 나머지 visit 메서드들
  visit(node: ASTNode): string {
    switch (node.type) {
      case 'NumberLiteral': {
        const dest = this.newTemp();
        this.emit({ op: 'CONST', dest, value: (node as NumberLiteral).value });
        return dest;
      }
      case 'BinaryExpression':
        return this.visitBinaryExpression(node as BinaryExpression);
      case 'IfStatement':
        return this.visitIfStatement(node as IfStatement);
      default:
        return '';
    }
  }

  getInstructions(): IRInstruction[] {
    return this.instructions;
  }
}

LLVM IR의 기본 구조:

; 함수 정의
define i32 @add(i32 %a, i32 %b) {
entry:
  %sum = add i32 %a, %b
  ret i32 %sum
}

; if-else 구조
define i32 @max(i32 %a, i32 %b) {
entry:
  %cmp = icmp sgt i32 %a, %b
  br i1 %cmp, label %then, label %else

then:
  ret i32 %a

else:
  ret i32 %b
}

; 루프 구조
define i32 @sum_to_n(i32 %n) {
entry:
  br label %loop

loop:
  %i = phi i32 [ 0, %entry ], [ %next_i, %loop ]
  %sum = phi i32 [ 0, %entry ], [ %next_sum, %loop ]
  %next_sum = add i32 %sum, %i
  %next_i = add i32 %i, 1
  %cond = icmp slt i32 %next_i, %n
  br i1 %cond, label %loop, label %exit

exit:
  ret i32 %next_sum
}

SSA(Static Single Assignment) 특징:
- 각 변수는 정확히 한 번만 할당됨
- phi 노드로 제어 흐름 합류 지점 처리
- 최적화 패스를 적용하기 용이

// 상수 폴딩: 컴파일 시점에 상수 표현식 계산
class ConstantFolding {
  optimize(node: ASTNode): ASTNode {
    if (node.type === 'BinaryExpression') {
      const binary = node as BinaryExpression;
      const left = this.optimize(binary.left);
      const right = this.optimize(binary.right);

      // 양쪽 모두 상수이면 미리 계산
      if (left.type === 'NumberLiteral' && right.type === 'NumberLiteral') {
        const leftVal = (left as NumberLiteral).value;
        const rightVal = (right as NumberLiteral).value;

        let result: number;
        switch (binary.operator) {
          case '+': result = leftVal + rightVal; break;
          case '-': result = leftVal - rightVal; break;
          case '*': result = leftVal * rightVal; break;
          case '/': result = leftVal / rightVal; break;
          default: return { ...binary, left, right };
        }

        return { type: 'NumberLiteral', value: result };
      }

      return { ...binary, left, right };
    }

    return node;
  }
}

// 예: 2 + 3 * 4 -> 14

// 죽은 코드 제거
class DeadCodeElimination {
  optimize(program: Program): Program {
    const usedVariables = this.collectUsedVariables(program);

    const optimizedBody = program.body.filter((stmt) => {
      if (stmt.type === 'VariableDeclaration') {
        const decl = stmt as VariableDeclaration;
        // 사용되지 않고 사이드 이펙트가 없으면 제거
        if (!usedVariables.has(decl.name) && !this.hasSideEffects(decl.initializer)) {
          return false;
        }
      }
      return true;
    });

    return { ...program, body: optimizedBody };
  }

  private collectUsedVariables(program: Program): Set<string> {
    const used = new Set<string>();

    function walk(node: ASTNode): void {
      if (node.type === 'Identifier') {
        used.add((node as Identifier).name);
      }
      // 자식 노드 순회
      for (const child of getChildren(node)) {
        walk(child);
      }
    }

    program.body.forEach(walk);
    return used;
  }

  private hasSideEffects(node: ASTNode | null): boolean {
    if (!node) return false;
    return node.type === 'CallExpression';
  }
}

// 함수 인라이닝: 작은 함수의 본문을 호출 위치에 삽입
class FunctionInliner {
  private functions: Map<string, FunctionDeclaration> = new Map();

  optimize(program: Program): Program {
    // 1단계: 함수 수집
    for (const stmt of program.body) {
      if (stmt.type === 'FunctionDeclaration') {
        const fn = stmt as FunctionDeclaration;
        this.functions.set(fn.name, fn);
      }
    }

    // 2단계: 인라이닝 가능한 호출 찾아서 대체
    return this.transformProgram(program);
  }

  private shouldInline(fn: FunctionDeclaration): boolean {
    // 함수 본문이 3문장 이하이고 재귀가 아니면 인라이닝
    const bodySize = fn.body.body.length;
    const isRecursive = this.containsCallTo(fn.body, fn.name);
    return bodySize <= 3 && !isRecursive;
  }

  private containsCallTo(node: ASTNode, name: string): boolean {
    if (node.type === 'CallExpression') {
      const call = node as CallExpression;
      if (call.callee.type === 'Identifier' && (call.callee as Identifier).name === name) {
        return true;
      }
    }
    return false;
  }

  private transformProgram(program: Program): Program {
    // 인라이닝 변환 로직
    return program; // 간략화
  }
}

루프 최적화 기법들:

1. 루프 불변 코드 이동 (LICM - Loop Invariant Code Motion)
   // Before                    // After
   for (i = 0; i < n; i++)    x = a + b;  // 루프 밖으로 이동
     arr[i] = a + b + i;      for (i = 0; i < n; i++)
                                  arr[i] = x + i;

2. 루프 풀기 (Loop Unrolling)
   // Before                    // After
   for (i = 0; i < 4; i++)    arr[0] = 0;
     arr[i] = 0;               arr[1] = 0;
                                arr[2] = 0;
                                arr[3] = 0;

3. 강도 축소 (Strength Reduction)
   // Before                    // After
   for (i = 0; i < n; i++)    t = 0;
     arr[i] = i * 4;           for (i = 0; i < n; i++)
                                  arr[i] = t;
                                  t = t + 4;  // 곱셈 -> 덧셈

// AST -> WebAssembly Text Format (WAT) 코드 생성
class WasmCodeGenerator {
  private output: string[] = [];

  generate(program: Program): string {
    this.output.push('(module');

    for (const stmt of program.body) {
      if (stmt.type === 'FunctionDeclaration') {
        this.generateFunction(stmt as FunctionDeclaration);
      }
    }

    this.output.push(')');
    return this.output.join('\n');
  }

  private generateFunction(node: FunctionDeclaration): void {
    const params = node.params.map((p) => '(param $' + p + ' i32)').join(' ');

    this.output.push('  (func $' + node.name + ' ' + params + ' (result i32)');

    // 로컬 변수 선언
    this.output.push('    (local $__result i32)');

    // 함수 본문 생성
    for (const stmt of node.body.body) {
      this.generateStatement(stmt);
    }

    this.output.push('  )');
    this.output.push('  (export "' + node.name + '" (func $' + node.name + '))');
  }

  private generateExpression(node: ASTNode): void {
    switch (node.type) {
      case 'NumberLiteral':
        this.output.push('    i32.const ' + (node as NumberLiteral).value);
        break;

      case 'Identifier':
        this.output.push('    local.get $' + (node as Identifier).name);
        break;

      case 'BinaryExpression': {
        const binary = node as BinaryExpression;
        this.generateExpression(binary.left);
        this.generateExpression(binary.right);

        const opMap: Record<string, string> = {
          '+': 'i32.add',
          '-': 'i32.sub',
          '*': 'i32.mul',
          '/': 'i32.div_s',
          '<': 'i32.lt_s',
          '>': 'i32.gt_s',
          '==': 'i32.eq',
          '!=': 'i32.ne',
        };

        this.output.push('    ' + opMap[binary.operator]);
        break;
      }
    }
  }

  private generateStatement(node: ASTNode): void {
    // 문장 코드 생성
    if (node.type === 'ReturnStatement') {
      const ret = node as ReturnStatement;
      if (ret.value) {
        this.generateExpression(ret.value);
      }
      this.output.push('    return');
    }
  }
}

// 스택 기반 바이트코드
enum OpCode {
  CONST = 0x01,      // 상수 푸시
  ADD = 0x02,        // 덧셈
  SUB = 0x03,        // 뺄셈
  MUL = 0x04,        // 곱셈
  DIV = 0x05,        // 나눗셈
  LOAD = 0x10,       // 변수 로드
  STORE = 0x11,      // 변수 저장
  JUMP = 0x20,       // 무조건 점프
  JUMP_IF_FALSE = 0x21, // 조건부 점프
  CALL = 0x30,       // 함수 호출
  RETURN = 0x31,     // 리턴
  PRINT = 0x40,      // 출력
  HALT = 0xFF,       // 정지
}

class BytecodeCompiler {
  private bytecode: number[] = [];
  private constants: any[] = [];
  private locals: Map<string, number> = new Map();

  compile(program: Program): Uint8Array {
    for (const stmt of program.body) {
      this.compileNode(stmt);
    }
    this.emit(OpCode.HALT);

    return new Uint8Array(this.bytecode);
  }

  private compileNode(node: ASTNode): void {
    switch (node.type) {
      case 'NumberLiteral': {
        const index = this.addConstant((node as NumberLiteral).value);
        this.emit(OpCode.CONST);
        this.emit(index);
        break;
      }

      case 'BinaryExpression': {
        const binary = node as BinaryExpression;
        this.compileNode(binary.left);
        this.compileNode(binary.right);

        switch (binary.operator) {
          case '+': this.emit(OpCode.ADD); break;
          case '-': this.emit(OpCode.SUB); break;
          case '*': this.emit(OpCode.MUL); break;
          case '/': this.emit(OpCode.DIV); break;
        }
        break;
      }

      case 'VariableDeclaration': {
        const decl = node as VariableDeclaration;
        const slot = this.locals.size;
        this.locals.set(decl.name, slot);

        if (decl.initializer) {
          this.compileNode(decl.initializer);
          this.emit(OpCode.STORE);
          this.emit(slot);
        }
        break;
      }

      case 'Identifier': {
        const id = node as Identifier;
        const slot = this.locals.get(id.name);
        if (slot === undefined) {
          throw new Error('Undefined variable: ' + id.name);
        }
        this.emit(OpCode.LOAD);
        this.emit(slot);
        break;
      }
    }
  }

  private emit(byte: number): void {
    this.bytecode.push(byte);
  }

  private addConstant(value: any): number {
    this.constants.push(value);
    return this.constants.length - 1;
  }
}

// Tree-Walking 인터프리터
class TreeWalkInterpreter {
  private environment: Environment;

  constructor() {
    this.environment = new Environment();
    // 내장 함수 등록
    this.environment.define('print', (args: any[]) => {
      console.log(...args);
      return null;
    });
  }

  interpret(program: Program): any {
    let result: any = null;
    for (const stmt of program.body) {
      result = this.execute(stmt);
    }
    return result;
  }

  private execute(node: ASTNode): any {
    switch (node.type) {
      case 'NumberLiteral':
        return (node as NumberLiteral).value;

      case 'StringLiteral':
        return (node as StringLiteral).value;

      case 'BooleanLiteral':
        return (node as BooleanLiteral).value;

      case 'Identifier':
        return this.environment.get((node as Identifier).name);

      case 'BinaryExpression': {
        const binary = node as BinaryExpression;
        const left = this.execute(binary.left);
        const right = this.execute(binary.right);

        switch (binary.operator) {
          case '+': return left + right;
          case '-': return left - right;
          case '*': return left * right;
          case '/': return left / right;
          case '%': return left % right;
          case '==': return left === right;
          case '!=': return left !== right;
          case '<': return left < right;
          case '>': return left > right;
          case '&&': return left && right;
          case '||': return left || right;
          default: throw new Error('Unknown operator: ' + binary.operator);
        }
      }

      case 'VariableDeclaration': {
        const decl = node as VariableDeclaration;
        const value = decl.initializer ? this.execute(decl.initializer) : null;
        this.environment.define(decl.name, value);
        return null;
      }

      case 'FunctionDeclaration': {
        const fn = node as FunctionDeclaration;
        const closure = this.environment;

        const callable = (args: any[]) => {
          const fnEnv = new Environment(closure);
          fn.params.forEach((param, i) => {
            fnEnv.define(param, args[i]);
          });

          const prevEnv = this.environment;
          this.environment = fnEnv;

          try {
            for (const stmt of fn.body.body) {
              const result = this.execute(stmt);
              if (result && result.__return__) {
                return result.value;
              }
            }
          } finally {
            this.environment = prevEnv;
          }

          return null;
        };

        this.environment.define(fn.name, callable);
        return null;
      }

      case 'CallExpression': {
        const call = node as CallExpression;
        const fn = this.execute(call.callee);
        const args = call.arguments.map((arg: ASTNode) => this.execute(arg));
        return fn(args);
      }

      case 'IfStatement': {
        const ifStmt = node as IfStatement;
        const condition = this.execute(ifStmt.condition);

        if (condition) {
          return this.executeBlock(ifStmt.consequent);
        } else if (ifStmt.alternate) {
          if (ifStmt.alternate.type === 'BlockStatement') {
            return this.executeBlock(ifStmt.alternate as BlockStatement);
          }
          return this.execute(ifStmt.alternate);
        }
        return null;
      }

      case 'ReturnStatement': {
        const ret = node as ReturnStatement;
        return {
          __return__: true,
          value: ret.value ? this.execute(ret.value) : null,
        };
      }

      case 'BlockStatement':
        return this.executeBlock(node as BlockStatement);

      default:
        throw new Error('Unknown node type: ' + node.type);
    }
  }

  private executeBlock(block: BlockStatement): any {
    const prevEnv = this.environment;
    this.environment = new Environment(prevEnv);

    try {
      for (const stmt of block.body) {
        const result = this.execute(stmt);
        if (result && result.__return__) return result;
      }
    } finally {
      this.environment = prevEnv;
    }

    return null;
  }
}

// 환경(Environment) - 변수 바인딩 관리
class Environment {
  private bindings: Map<string, any> = new Map();
  private parent: Environment | null;

  constructor(parent: Environment | null = null) {
    this.parent = parent;
  }

  define(name: string, value: any): void {
    this.bindings.set(name, value);
  }

  get(name: string): any {
    if (this.bindings.has(name)) {
      return this.bindings.get(name);
    }
    if (this.parent) return this.parent.get(name);
    throw new Error('Undefined variable: ' + name);
  }

  set(name: string, value: any): void {
    if (this.bindings.has(name)) {
      this.bindings.set(name, value);
      return;
    }
    if (this.parent) { this.parent.set(name, value); return; }
    throw new Error('Undefined variable: ' + name);
  }
}