递归下降解析法在编译器设计中的应用与实现

package cn.juwatech.compiler;

public class ArithmeticParser {
    
    private Lexer lexer;
    private Token currentToken;

    public ArithmeticParser(Lexer lexer) {
        this.lexer = lexer;
        this.nextToken();
    }

    private void nextToken() {
        currentToken = lexer.nextToken();
    }

    public void parse() {
        expression();
        if (currentToken != null) {
            throw new ParseException("Unexpected token: " + currentToken);
        }
    }

    private void expression() {
        term();
        while (currentToken.type == TokenType.PLUS || currentToken.type == TokenType.MINUS) {
            if (currentToken.type == TokenType.PLUS) {
                nextToken();
                term();
            } else {
                nextToken();
                term();
            }
        }
    }

    private void term() {
        factor();
        while (currentToken.type == TokenType.TIMES || currentToken.type == TokenType.DIVIDE) {
            if (currentToken.type == TokenType.TIMES) {
                nextToken();
                factor();
            } else {
                nextToken();
                factor();
            }
        }
    }

    private void factor() {
        if (currentToken.type == TokenType.NUMBER) {
            // Process number, for example, evaluate its value
            int value = Integer.parseInt(currentToken.value);
            // Imagine we have a stack to store values
            // stack.push(value);
            nextToken();
        } else if (currentToken.type == TokenType.LPAREN) {
            nextToken();
            expression();
            match(TokenType.RPAREN);
        }
    }

    private void match(TokenType type) {
        if (currentToken.type != type) {
            throw new ParseException("Expected " + type + " but found " + currentToken);
        }
        nextToken();
    }
}

class ParseException extends Exception {
    public ParseException(String message) {
        super(message);
    }
}

class Lexer {
    // Lexer implementation...
}

enum TokenType {
    NUMBER, PLUS, MINUS, TIMES, DIVIDE, LPAREN, RPAREN
}

class Token {
    TokenType type;
    String value;

    Token(TokenType type, String value) {
        this.type = type;
        this.value = value;
    }
}

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.
• 14.
• 15.
• 16.
• 17.
• 18.
• 19.
• 20.
• 21.
• 22.
• 23.
• 24.
• 25.
• 26.
• 27.
• 28.
• 29.
• 30.
• 31.
• 32.
• 33.
• 34.
• 35.
• 36.
• 37.
• 38.
• 39.
• 40.
• 41.
• 42.
• 43.
• 44.
• 45.
• 46.
• 47.
• 48.
• 49.
• 50.
• 51.
• 52.
• 53.
• 54.
• 55.
• 56.
• 57.
• 58.
• 59.
• 60.
• 61.
• 62.
• 63.
• 64.
• 65.
• 66.
• 67.
• 68.
• 69.
• 70.
• 71.
• 72.
• 73.
• 74.
• 75.
• 76.
• 77.
• 78.
• 79.
• 80.
• 81.
• 82.
• 83.
• 84.
• 85.
• 86.
• 87.
• 88.
• 89.
• 90.
• 91.
• 92.
• 93.
• 94.