cobalt-lang/cobalt/lang/Parser.java

216 lines
5.0 KiB
Java

package cobalt.lang;
import java.util.List;
import static cobalt.lang.TokenType.*;
class Parser {
private static class ParseError extends RuntimeException {}
private final List<Token> tokens;
private int current = 0;
Parser(List<Token> tokens) {
this.tokens = tokens;
}
Expr parse() {
try {
return expression();
} catch (ParseError error) {
return null;
}
}
private Expr expression() {
return equality();
}
// Parser definition for handling equalities
//
// equality -> comparison ( ( "!=" | "==" ) comparison )* ;
//
private Expr equality() {
Expr expr = comparison();
while (match(BANG_EQUAL, EQUAL_EQUAL)) {
Token operator = previous();
Expr right = comparison();
expr = new Expr.Binary(expr, operator, right);
}
return expr;
}
// Parser definition for handling comparisons
//
// comparison -> term ( ( ">" | ">=" | "<" | "<=" ) term )* ;
//
private Expr comparison() {
Expr expr = term();
while (match(GREATER, GREATER_EQUAL, LESS, LESS_EQUAL)) {
Token operator = previous();
Expr right = term();
expr = new Expr.Binary(expr, operator, right);
}
return expr;
}
private Expr term() {
Expr expr = factor();
while (match(MINUS, PLUS)) {
Token operator = previous();
Expr right = factor();
expr = new Expr.Binary(expr, operator, right);
}
return expr;
}
private Expr factor() {
Expr expr = unary();
while (match(SLASH, STAR)) {
Token operator = previous();
Expr right = unary();
expr = new Expr.Binary(expr, operator, right);
}
return expr;
}
// Parser definition for handling unary statements
//
// unary -> ( "!" | "-" ) unary
// | primary ;
//
private Expr unary() {
if (match(BANG, MINUS)) {
Token operator = previous();
Expr right = unary();
return new Expr.Unary(operator, right);
}
return primary();
}
// Parser definition for handling primary statements
//
// primary -> NUMBER | STRING | "true" | "false" | "nil"
// | "(" expression ")" ;
//
private Expr primary() {
if (match(FALSE)) return new Expr.Literal(false);
if (match(TRUE)) return new Expr.Literal(true);
if (match(NIL)) return new Expr.Literal(null);
if (match(NUMBER, STRING)) {
return new Expr.Literal(previous().literal);
}
if (match(LEFT_PAREN)) {
Expr expr = expression();
consume(RIGHT_PAREN, "Expect ')' after expression.");
return new Expr.Grouping(expr);
}
throw error(peek(), "Expected expression.");
}
// Checks to see if the current token has any of the given types. If so,
// it consumes the token and returns true. Otherwise, it returns false and leaves
// the current token alone.
private boolean match(TokenType... types) {
for (TokenType type : types) {
if (check(type)) {
advance();
return true;
}
}
return false;
}
// Consume function
private Token consume(TokenType type, String message) {
if (check(type)) return advance();
throw error(peek(), message);
}
// Returns true if the current token is of the given type, false if otherwise
private boolean check(TokenType type) {
if (isAtEnd()) return false;
return peek().type == type;
}
// Consume the current token and return it
private Token advance() {
if (!isAtEnd()) current++;
return previous();
}
// Check to see if we've run out of tokens to parse
private boolean isAtEnd() {
return peek().type == EOF;
}
// Return the current token we have yet to consume
private Token peek() {
return tokens.get(current);
}
// Return the previous token we just consumed
private Token previous() {
return tokens.get(current - 1);
}
// Throw a new parse error based on the incorrect token
private ParseError error(Token token, String message) {
Cobalt.error(token, message);
return new ParseError();
}
// Once finding a parse error, discard the rest of the tokens in
// a statement in order to prevent cascading errors.
private void synchronize() {
advance();
while (!isAtEnd()) {
if (previous().type == SEMICOLON) return;
switch (peek().type) {
case CLASS:
case FOR:
case FUNC:
case IF:
case PRINT:
case RETURN:
case VAR:
case WHILE:
return;
}
advance();
}
}
}