vig/src/parser.zig

158 lines
4.2 KiB
Zig
Raw Normal View History

2019-06-05 01:11:11 +00:00
const std = @import("std");
const scanners = @import("scanner.zig");
const main = @import("main.zig");
const ast = @import("ast.zig");
const tokens = @import("tokens.zig");
2019-06-06 01:06:12 +00:00
const err = @import("errors.zig");
2019-06-05 01:11:11 +00:00
const Allocator = std.mem.Allocator;
const Scanner = scanners.Scanner;
const Token = tokens.Token;
const TokenType = tokens.TokenType;
const Result = main.Result;
const Node = ast.Node;
2019-06-06 01:06:12 +00:00
2019-06-05 01:11:11 +00:00
pub const Parser = struct {
allocator: *Allocator,
scanner: *Scanner,
2019-06-06 01:06:12 +00:00
tokens: []Token = undefined,
current: usize = 0,
2019-06-05 01:11:11 +00:00
pub fn init(allocator: *Allocator, scanner: *Scanner) Parser {
return Parser{ .allocator = allocator, .scanner = scanner };
}
fn doError(self: *Parser, comptime fmt: []const u8, args: ...) Result!void {
2019-06-05 01:11:11 +00:00
std.debug.warn("parser error at line {}\n\t", self.scanner.line);
std.debug.warn(fmt, args);
std.debug.warn("\n");
return Result.CompileError;
}
2019-06-06 01:06:12 +00:00
fn peek(self: *Parser) Token {
return self.tokens[self.current];
}
fn previous(self: *Parser) Token {
return self.tokens[self.current - 1];
}
fn tokenError(self: *Parser, token: Token, msg: []const u8) Result!void {
if (token.ttype == .EOF) {
err.report(token.line, " at end", msg);
} else {
err.reportFmt(token.line, " at '{}': {}", token.lexeme, msg);
2019-06-05 01:11:11 +00:00
}
2019-06-06 01:06:12 +00:00
return Result.CompileError;
2019-06-05 01:11:11 +00:00
}
2019-06-06 01:06:12 +00:00
fn isAtEnd(self: *Parser) bool {
return self.peek().ttype == .EOF;
}
fn advance(self: *Parser) Token {
if (!self.isAtEnd()) self.current += 1;
return self.previous();
}
fn check(self: *Parser, ttype: TokenType) bool {
if (self.isAtEnd()) return false;
return self.peek().ttype == ttype;
}
fn match(self: *Parser, ttypes: []TokenType) bool {
for (ttypes) |ttype| {
if (self.check(ttype)) {
_ = self.advance();
return true;
}
}
return false;
}
fn matchSingle(self: *Parser, ttype: TokenType) bool {
if (self.check(ttype)) {
_ = self.advance();
2019-06-05 01:11:11 +00:00
return true;
}
2019-06-06 01:06:12 +00:00
return false;
}
fn consume(self: *Parser, ttype: TokenType, comptime msg: []const u8) Result!Token {
if (self.check(ttype)) return self.advance();
try self.tokenError(self.peek(), msg);
return Result.CompileError;
2019-06-05 01:11:11 +00:00
}
2019-07-01 18:25:07 +00:00
fn consumeSingle(self: *Parser, ttype: TokenType) !Token {
if (self.check(ttype)) return self.advance();
var buf_main: [1000]u8 = undefined;
var buf = try std.fmt.bufPrint(
buf_main[0..],
"expected {}, got {}",
ttype,
self.peek().ttype,
);
try self.tokenError(self.peek(), buf);
return Result.CompileError;
}
fn mkFnDecl(self: *Parser, name: Token) !*ast.Node {
var node = try self.allocator.create(Node);
node.* = Node{ .FnDecl = ast.FnDecl{ .func_name = name } };
return node;
2019-06-06 01:06:12 +00:00
}
fn functionDecl(self: *Parser) !*ast.Node {
// get the name
var name = try self.consume(.Identifier, "expected function name");
2019-07-01 18:25:07 +00:00
_ = try self.consumeSingle(.LeftParen);
return try self.mkFnDecl(name);
2019-06-06 01:06:12 +00:00
}
2019-07-01 18:25:07 +00:00
fn processToken(self: *Parser, token: Token) !*ast.Node {
var node = switch (token.ttype) {
.Fn => try self.functionDecl(),
else => blk: {
try self.doError("TODO handle {}\n", token.ttype);
return Result.CompileError;
},
2019-07-01 18:25:07 +00:00
};
return node;
2019-06-06 01:06:12 +00:00
}
pub fn parse(self: *Parser) !*ast.Node {
2019-06-06 01:06:12 +00:00
self.tokens = try self.allocator.alloc(Token, 0);
var i: usize = 0;
var root = try ast.mkRoot(self.allocator);
2019-06-06 01:06:12 +00:00
while (true) {
var tok_opt = try self.scanner.nextToken();
2019-06-06 01:06:12 +00:00
if (tok_opt) |token| {
self.tokens = try self.allocator.realloc(self.tokens, i + 1);
self.tokens[i] = token;
i += 1;
if (token.ttype == .EOF) break;
var node = try self.processToken(token);
2019-07-01 18:25:07 +00:00
try root.Root.append(node);
} else {
continue;
2019-06-06 01:06:12 +00:00
}
}
return root;
2019-06-05 01:11:11 +00:00
}
};