1317 lines
35 KiB
C
1317 lines
35 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <sys/types.h>
|
|
|
|
#include "kuroko.h"
|
|
#include "compiler.h"
|
|
#include "memory.h"
|
|
#include "scanner.h"
|
|
#include "object.h"
|
|
#include "debug.h"
|
|
#include "vm.h"
|
|
|
|
typedef struct {
|
|
KrkToken current;
|
|
KrkToken previous;
|
|
int hadError;
|
|
int panicMode;
|
|
} Parser;
|
|
|
|
typedef enum {
|
|
PREC_NONE,
|
|
PREC_ASSIGNMENT, /* = */
|
|
PREC_OR, /* or */
|
|
PREC_AND, /* and */
|
|
PREC_EQUALITY, /* == != in */
|
|
PREC_COMPARISON, /* < > <= >= */
|
|
PREC_TERM, /* + - */
|
|
PREC_FACTOR, /* * */
|
|
PREC_UNARY, /* ! - not */
|
|
PREC_CALL, /* . () */
|
|
PREC_PRIMARY
|
|
} Precedence;
|
|
|
|
typedef void (*ParseFn)(int);
|
|
|
|
typedef struct {
|
|
const char * name;
|
|
ParseFn prefix;
|
|
ParseFn infix;
|
|
Precedence precedence;
|
|
} ParseRule;
|
|
|
|
typedef struct {
|
|
KrkToken name;
|
|
ssize_t depth;
|
|
int isCaptured;
|
|
} Local;
|
|
|
|
typedef struct {
|
|
size_t index;
|
|
int isLocal;
|
|
} Upvalue;
|
|
|
|
typedef enum {
|
|
TYPE_FUNCTION,
|
|
TYPE_MODULE,
|
|
TYPE_METHOD,
|
|
TYPE_INIT,
|
|
} FunctionType;
|
|
|
|
#define MAX_LOCALS 256
|
|
typedef struct Compiler {
|
|
struct Compiler * enclosing;
|
|
KrkFunction * function;
|
|
FunctionType type;
|
|
Local locals[MAX_LOCALS];
|
|
size_t localCount;
|
|
size_t scopeDepth;
|
|
Upvalue upvalues[MAX_LOCALS];
|
|
} Compiler;
|
|
|
|
typedef struct ClassCompiler {
|
|
struct ClassCompiler * enclosing;
|
|
KrkToken name;
|
|
int hasSuperClass;
|
|
} ClassCompiler;
|
|
|
|
Parser parser;
|
|
Compiler * current = NULL;
|
|
ClassCompiler * currentClass = NULL;
|
|
|
|
static KrkChunk * currentChunk() {
|
|
return ¤t->function->chunk;
|
|
}
|
|
|
|
#define EMIT_CONSTANT_OP(opc, arg) do { if (arg < 256) { emitBytes(opc, arg); } \
|
|
else { emitBytes(opc ## _LONG, arg >> 16); emitBytes(arg >> 8, arg); } } while (0)
|
|
|
|
static void initCompiler(Compiler * compiler, FunctionType type) {
|
|
compiler->enclosing = current;
|
|
compiler->function = NULL;
|
|
compiler->type = type;
|
|
compiler->localCount = 0;
|
|
compiler->scopeDepth = 0;
|
|
compiler->function = krk_newFunction();
|
|
current = compiler;
|
|
|
|
if (type != TYPE_MODULE) {
|
|
current->function->name = krk_copyString(parser.previous.start, parser.previous.length);
|
|
}
|
|
|
|
Local * local = ¤t->locals[current->localCount++];
|
|
local->depth = 0;
|
|
local->isCaptured = 0;
|
|
|
|
if (type != TYPE_FUNCTION) {
|
|
local->name.start = "self";
|
|
local->name.length = 4;
|
|
} else {
|
|
local->name.start = "";
|
|
local->name.length = 0;
|
|
}
|
|
}
|
|
|
|
static void parsePrecedence(Precedence precedence);
|
|
static ssize_t parseVariable(const char * errorMessage);
|
|
static void variable(int canAssign);
|
|
static void defineVariable(size_t global);
|
|
static uint8_t argumentList();
|
|
static ssize_t identifierConstant(KrkToken * name);
|
|
static ssize_t resolveLocal(Compiler * compiler, KrkToken * name);
|
|
static ParseRule * getRule(KrkTokenType type);
|
|
static void defDeclaration();
|
|
static void expression();
|
|
static void statement();
|
|
static void declaration();
|
|
static void or_(int canAssign);
|
|
static void and_(int canAssign);
|
|
static void classDeclaration();
|
|
static void declareVariable();
|
|
static void namedVariable(KrkToken name, int canAssign);
|
|
static void addLocal(KrkToken name);
|
|
|
|
static void errorAt(KrkToken * token, const char * message) {
|
|
if (parser.panicMode) return;
|
|
parser.panicMode = 1;
|
|
|
|
size_t i = (token->col - 1);
|
|
while (token->linePtr[i] && token->linePtr[i] != '\n') i++;
|
|
|
|
fprintf(stderr, "Parse error in \"%s\" on line %d col %d (%s): %s\n"
|
|
" %.*s\033[31m%.*s\033[39m%.*s\n"
|
|
" %-*s\033[31m^\033[39m\n",
|
|
currentChunk()->filename->chars,
|
|
(int)token->line,
|
|
(int)token->col,
|
|
getRule(token->type)->name,
|
|
message,
|
|
(int)(token->col - 1),
|
|
token->linePtr,
|
|
(int)(token->literalWidth),
|
|
token->linePtr + (token->col - 1),
|
|
(int)(i - (token->col - 1 + token->literalWidth)),
|
|
token->linePtr + (token->col - 1 + token->literalWidth),
|
|
(int)token->col-1,
|
|
""
|
|
);
|
|
parser.hadError = 1;
|
|
}
|
|
|
|
static void error(const char * message) {
|
|
errorAt(&parser.previous, message);
|
|
}
|
|
|
|
static void errorAtCurrent(const char * message) {
|
|
errorAt(&parser.current, message);
|
|
}
|
|
|
|
static void advance() {
|
|
parser.previous = parser.current;
|
|
|
|
for (;;) {
|
|
parser.current = krk_scanToken();
|
|
|
|
#ifdef ENABLE_DEBUGGING
|
|
if (vm.flags & KRK_ENABLE_DEBUGGING) {
|
|
fprintf(stderr, "Token %d (start=%p, length=%d) '%.*s' on line %d\n", parser.current.type,
|
|
parser.current.start,
|
|
(int)parser.current.length,
|
|
(int)parser.current.length,
|
|
parser.current.start,
|
|
(int)parser.current.line);
|
|
}
|
|
#endif
|
|
|
|
if (parser.current.type == TOKEN_RETRY) continue;
|
|
if (parser.current.type != TOKEN_ERROR) break;
|
|
|
|
errorAtCurrent(parser.current.start);
|
|
}
|
|
}
|
|
|
|
static void consume(KrkTokenType type, const char * message) {
|
|
if (parser.current.type == type) {
|
|
advance();
|
|
return;
|
|
}
|
|
|
|
errorAtCurrent(message);
|
|
}
|
|
|
|
static int check(KrkTokenType type) {
|
|
return parser.current.type == type;
|
|
}
|
|
|
|
static int match(KrkTokenType type) {
|
|
if (!check(type)) return 0;
|
|
advance();
|
|
return 1;
|
|
}
|
|
|
|
static int identifiersEqual(KrkToken * a, KrkToken * b) {
|
|
return (a->length == b->length && memcmp(a->start, b->start, a->length) == 0);
|
|
}
|
|
|
|
static KrkToken syntheticToken(const char * text) {
|
|
KrkToken token;
|
|
token.start = text;
|
|
token.length = (int)strlen(text);
|
|
return token;
|
|
}
|
|
|
|
static void emitByte(uint8_t byte) {
|
|
krk_writeChunk(currentChunk(), byte, parser.previous.line);
|
|
}
|
|
|
|
static void emitBytes(uint8_t byte1, uint8_t byte2) {
|
|
emitByte(byte1);
|
|
emitByte(byte2);
|
|
}
|
|
|
|
static void emitReturn() {
|
|
if (current->type == TYPE_INIT) {
|
|
emitBytes(OP_GET_LOCAL, 0);
|
|
} else if (current->type == TYPE_MODULE) {
|
|
/* Un-pop the last stack value */
|
|
emitBytes(OP_GET_LOCAL, 1);
|
|
} else {
|
|
emitByte(OP_NONE);
|
|
}
|
|
emitByte(OP_RETURN);
|
|
}
|
|
|
|
static KrkFunction * endCompiler() {
|
|
emitReturn();
|
|
KrkFunction * function = current->function;
|
|
#ifdef ENABLE_DEBUGGING
|
|
if ((vm.flags & KRK_ENABLE_DEBUGGING) && !parser.hadError) {
|
|
krk_disassembleChunk(currentChunk(), function->name != NULL ? function->name->chars : "<module>");
|
|
}
|
|
#endif
|
|
|
|
current = current->enclosing;
|
|
return function;
|
|
}
|
|
|
|
static void endOfLine() {
|
|
if (!(match(TOKEN_EOL) || match(TOKEN_EOF))) {
|
|
errorAtCurrent("Expected end of line.");
|
|
}
|
|
}
|
|
|
|
static size_t emitConstant(KrkValue value) {
|
|
return krk_writeConstant(currentChunk(), value, parser.previous.line);
|
|
}
|
|
|
|
static void number(int canAssign) {
|
|
const char * start = parser.previous.start;
|
|
int base = 10;
|
|
|
|
/* These special cases for hexadecimal, binary, octal values. */
|
|
if (start[0] == '0' && (start[1] == 'x' || start[1] == 'X')) {
|
|
base = 16;
|
|
start += 2;
|
|
} else if (start[0] == '0' && (start[1] == 'b' || start[1] == 'B')) {
|
|
base = 2;
|
|
start += 2;
|
|
} else if (start[0] == '0' && (start[1] == 'o' || start[1] == 'O')) {
|
|
base = 8;
|
|
start += 2;
|
|
}
|
|
|
|
/* If it wasn't a special base, it may be a floating point value. */
|
|
if (base == 10) {
|
|
for (size_t j = 0; j < parser.previous.length; ++j) {
|
|
if (parser.previous.start[j] == '.') {
|
|
double value = strtod(start, NULL);
|
|
emitConstant(FLOATING_VAL(value));
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* If we got here, it's an integer of some sort. */
|
|
int value = strtol(start, NULL, base);
|
|
emitConstant(INTEGER_VAL(value));
|
|
}
|
|
|
|
static void binary(int canAssign) {
|
|
KrkTokenType operatorType = parser.previous.type;
|
|
ParseRule * rule = getRule(operatorType);
|
|
parsePrecedence((Precedence)(rule->precedence + 1));
|
|
|
|
switch (operatorType) {
|
|
case TOKEN_BANG_EQUAL: emitBytes(OP_EQUAL, OP_NOT); break;
|
|
case TOKEN_EQUAL_EQUAL: emitByte(OP_EQUAL); break;
|
|
case TOKEN_GREATER: emitByte(OP_GREATER); break;
|
|
case TOKEN_GREATER_EQUAL: emitBytes(OP_LESS, OP_NOT); break;
|
|
case TOKEN_LESS: emitByte(OP_LESS); break;
|
|
case TOKEN_LESS_EQUAL: emitBytes(OP_GREATER, OP_NOT); break;
|
|
|
|
case TOKEN_PLUS: emitByte(OP_ADD); break;
|
|
case TOKEN_MINUS: emitByte(OP_SUBTRACT); break;
|
|
case TOKEN_ASTERISK: emitByte(OP_MULTIPLY); break;
|
|
case TOKEN_SOLIDUS: emitByte(OP_DIVIDE); break;
|
|
case TOKEN_MODULO: emitByte(OP_MODULO); break;
|
|
default: return;
|
|
}
|
|
}
|
|
|
|
static void call(int canAssign) {
|
|
uint8_t argCount = argumentList();
|
|
emitBytes(OP_CALL, argCount);
|
|
}
|
|
|
|
static void get_(int canAssign) {
|
|
/* Synthesize get */
|
|
KrkToken _get = syntheticToken("__get__");
|
|
KrkToken _set = syntheticToken("__set__");
|
|
size_t indGet = identifierConstant(&_get);
|
|
size_t indSet = identifierConstant(&_set);
|
|
size_t offset = currentChunk()->count + 1;
|
|
emitBytes(OP_GET_PROPERTY, indGet); /* TODO what if it's > 256 */
|
|
expression();
|
|
consume(TOKEN_RIGHT_SQUARE, "Expected ending square bracket...");
|
|
if (canAssign && match(TOKEN_EQUAL)) {
|
|
expression();
|
|
currentChunk()->code[offset] = indSet;
|
|
emitBytes(OP_CALL, 2);
|
|
} else {
|
|
emitBytes(OP_CALL, 1);
|
|
}
|
|
}
|
|
|
|
static void dot(int canAssign) {
|
|
consume(TOKEN_IDENTIFIER, "Expected propert name");
|
|
size_t ind = identifierConstant(&parser.previous);
|
|
if (canAssign && match(TOKEN_EQUAL)) {
|
|
expression();
|
|
EMIT_CONSTANT_OP(OP_SET_PROPERTY, ind);
|
|
} else {
|
|
EMIT_CONSTANT_OP(OP_GET_PROPERTY, ind);
|
|
}
|
|
}
|
|
|
|
static void literal(int canAssign) {
|
|
switch (parser.previous.type) {
|
|
case TOKEN_FALSE: emitByte(OP_FALSE); break;
|
|
case TOKEN_NONE: emitByte(OP_NONE); break;
|
|
case TOKEN_TRUE: emitByte(OP_TRUE); break;
|
|
default: return;
|
|
}
|
|
}
|
|
|
|
static void expression() {
|
|
parsePrecedence(PREC_ASSIGNMENT);
|
|
}
|
|
|
|
static void varDeclaration() {
|
|
ssize_t ind = parseVariable("Expected variable name.");
|
|
|
|
if (match(TOKEN_EQUAL)) {
|
|
expression();
|
|
} else {
|
|
emitByte(OP_NONE);
|
|
}
|
|
|
|
defineVariable(ind);
|
|
}
|
|
|
|
static void printStatement() {
|
|
expression();
|
|
emitByte(OP_PRINT);
|
|
}
|
|
|
|
static void synchronize() {
|
|
parser.panicMode = 0;
|
|
while (parser.current.type != TOKEN_EOF) {
|
|
if (parser.previous.type == TOKEN_EOL) return;
|
|
|
|
switch (parser.current.type) {
|
|
case TOKEN_CLASS:
|
|
case TOKEN_DEF:
|
|
case TOKEN_LET:
|
|
case TOKEN_FOR:
|
|
case TOKEN_IF:
|
|
case TOKEN_WHILE:
|
|
case TOKEN_PRINT:
|
|
case TOKEN_RETURN:
|
|
return;
|
|
default: break;
|
|
}
|
|
|
|
advance();
|
|
}
|
|
}
|
|
|
|
static void declaration() {
|
|
if (check(TOKEN_DEF)) {
|
|
defDeclaration();
|
|
} else if (match(TOKEN_LET)) {
|
|
varDeclaration();
|
|
if (!match(TOKEN_EOL) && !match(TOKEN_EOF)) {
|
|
error("Expected EOL after variable declaration.\n");
|
|
}
|
|
} else if (check(TOKEN_CLASS)) {
|
|
classDeclaration();
|
|
} else if (match(TOKEN_EOL) || match(TOKEN_EOF)) {
|
|
return;
|
|
} else if (check(TOKEN_INDENTATION)) {
|
|
return;
|
|
} else {
|
|
statement();
|
|
}
|
|
|
|
if (parser.panicMode) synchronize();
|
|
}
|
|
|
|
static void expressionStatement() {
|
|
expression();
|
|
emitByte(OP_POP);
|
|
}
|
|
|
|
static void beginScope() {
|
|
current->scopeDepth++;
|
|
}
|
|
|
|
static void endScope() {
|
|
current->scopeDepth--;
|
|
while (current->localCount > 0 &&
|
|
current->locals[current->localCount - 1].depth > (ssize_t)current->scopeDepth) {
|
|
if (current->locals[current->localCount - 1].isCaptured) {
|
|
emitByte(OP_CLOSE_UPVALUE);
|
|
} else {
|
|
emitByte(OP_POP);
|
|
}
|
|
current->localCount--;
|
|
}
|
|
}
|
|
|
|
static void block(size_t indentation, const char * blockName) {
|
|
if (match(TOKEN_EOL)) {
|
|
/* Begin actual blocks */
|
|
if (check(TOKEN_INDENTATION)) {
|
|
size_t currentIndentation = parser.current.length;
|
|
if (currentIndentation <= indentation) {
|
|
return;
|
|
}
|
|
do {
|
|
if (parser.current.length < currentIndentation) break;
|
|
advance(); /* Pass indentation */
|
|
declaration();
|
|
} while (check(TOKEN_INDENTATION));
|
|
#ifdef ENABLE_DEBUGGING
|
|
if (vm.flags & KRK_ENABLE_DEBUGGING) {
|
|
fprintf(stderr, "finished with block %s (ind=%d) on line %d, sitting on a %s (len=%d)\n",
|
|
blockName,
|
|
(int)indentation,
|
|
(int)parser.current.line,
|
|
getRule(parser.current.type)->name,
|
|
(int)parser.current.length);
|
|
}
|
|
#endif
|
|
}
|
|
} else {
|
|
statement();
|
|
}
|
|
}
|
|
|
|
static void function(FunctionType type, size_t blockWidth) {
|
|
Compiler compiler;
|
|
initCompiler(&compiler, type);
|
|
compiler.function->chunk.filename = compiler.enclosing->function->chunk.filename;
|
|
|
|
beginScope();
|
|
|
|
consume(TOKEN_LEFT_PAREN, "Expected start of parameter list after function name.");
|
|
if (!check(TOKEN_RIGHT_PAREN)) {
|
|
do {
|
|
if (match(TOKEN_SELF)) {
|
|
if (type != TYPE_INIT && type != TYPE_METHOD) {
|
|
error("Invalid use of `self` as a function paramenter.");
|
|
}
|
|
continue;
|
|
}
|
|
ssize_t paramConstant = parseVariable("Expect parameter name.");
|
|
defineVariable(paramConstant);
|
|
if (match(TOKEN_EQUAL)) {
|
|
consume(TOKEN_NONE,"Optional arguments can only be assigned the default value of None.");
|
|
current->function->defaultArgs++;
|
|
if (current->function->defaultArgs > 255) errorAtCurrent("too many function parameters");
|
|
} else {
|
|
current->function->requiredArgs++;
|
|
if (current->function->requiredArgs > 255) errorAtCurrent("too many function parameters");
|
|
}
|
|
} while (match(TOKEN_COMMA));
|
|
}
|
|
consume(TOKEN_RIGHT_PAREN, "Expected end of parameter list.");
|
|
|
|
consume(TOKEN_COLON, "Expected colon after function signature.");
|
|
block(blockWidth,"def");
|
|
|
|
KrkFunction * function = endCompiler();
|
|
size_t ind = krk_addConstant(currentChunk(), OBJECT_VAL(function));
|
|
EMIT_CONSTANT_OP(OP_CLOSURE, ind);
|
|
|
|
for (size_t i = 0; i < function->upvalueCount; ++i) {
|
|
/* TODO: if the maximum count changes, fix the sizes for this */
|
|
emitByte(compiler.upvalues[i].isLocal ? 1 : 0);
|
|
emitByte(compiler.upvalues[i].index);
|
|
}
|
|
}
|
|
|
|
static void method(size_t blockWidth) {
|
|
/* This is actually "inside of a class definition", and that might mean
|
|
* arbitrary blank lines we need to accept... Sorry. */
|
|
if (match(TOKEN_EOL)) {
|
|
return;
|
|
}
|
|
|
|
/* def method(...): - just like functions; unlike Python, I'm just always
|
|
* going to assign `self` because Lox always assigns `this`; it should not
|
|
* show up in the initializer list; I may add support for it being there
|
|
* as a redundant thing, just to make more Python stuff work with changes. */
|
|
consume(TOKEN_DEF, "expected a definition, got nothing");
|
|
consume(TOKEN_IDENTIFIER, "expected method name");
|
|
size_t ind = identifierConstant(&parser.previous);
|
|
FunctionType type = TYPE_METHOD;
|
|
|
|
if (parser.previous.length == 8 && memcmp(parser.previous.start, "__init__", 8) == 0) {
|
|
type = TYPE_INIT;
|
|
}
|
|
|
|
function(type, blockWidth);
|
|
EMIT_CONSTANT_OP(OP_METHOD, ind);
|
|
}
|
|
|
|
static void classDeclaration() {
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
advance(); /* Collect the `class` */
|
|
|
|
consume(TOKEN_IDENTIFIER, "Expected class name.");
|
|
KrkToken className = parser.previous;
|
|
size_t constInd = identifierConstant(&parser.previous);
|
|
declareVariable();
|
|
|
|
EMIT_CONSTANT_OP(OP_CLASS, constInd);
|
|
defineVariable(constInd);
|
|
|
|
ClassCompiler classCompiler;
|
|
classCompiler.name = parser.previous;
|
|
classCompiler.hasSuperClass = 0;
|
|
classCompiler.enclosing = currentClass;
|
|
currentClass = &classCompiler;
|
|
|
|
if (match(TOKEN_LEFT_PAREN)) {
|
|
if (match(TOKEN_IDENTIFIER)) {
|
|
variable(0);
|
|
if (identifiersEqual(&className, &parser.previous)) {
|
|
error("A class can not inherit from itself.");
|
|
}
|
|
|
|
beginScope();
|
|
addLocal(syntheticToken("super"));
|
|
defineVariable(0);
|
|
|
|
namedVariable(className, 0);
|
|
emitByte(OP_INHERIT);
|
|
classCompiler.hasSuperClass = 1;
|
|
}
|
|
consume(TOKEN_RIGHT_PAREN, "Expected closing brace after superclass.");
|
|
}
|
|
|
|
namedVariable(className, 0);
|
|
|
|
consume(TOKEN_COLON, "Expected colon after class");
|
|
if (match(TOKEN_EOL)) {
|
|
if (check(TOKEN_INDENTATION)) {
|
|
size_t currentIndentation = parser.current.length;
|
|
if (currentIndentation <= blockWidth) {
|
|
errorAtCurrent("Unexpected indentation level for class");
|
|
}
|
|
do {
|
|
if (parser.current.length < currentIndentation) break;
|
|
advance(); /* Pass the indentation */
|
|
method(currentIndentation);
|
|
if (check(TOKEN_EOL)) endOfLine();
|
|
} while (check(TOKEN_INDENTATION));
|
|
#ifdef ENABLE_SCAN_TRACING
|
|
if (vm.flags & KRK_ENABLE_SCAN_TRACING) fprintf(stderr, "Exiting from class definition on %s\n", getRule(parser.current.type)->name);
|
|
#endif
|
|
/* Exit from block */
|
|
}
|
|
} /* else empty class (and at end of file?) we'll allow it for now... */
|
|
emitByte(OP_POP);
|
|
if (classCompiler.hasSuperClass) {
|
|
endScope();
|
|
}
|
|
currentClass = currentClass->enclosing;
|
|
}
|
|
|
|
static void markInitialized() {
|
|
if (current->scopeDepth == 0) return;
|
|
current->locals[current->localCount - 1].depth = current->scopeDepth;
|
|
}
|
|
|
|
static void defDeclaration() {
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
advance(); /* Collect the `def` */
|
|
|
|
ssize_t global = parseVariable("Expected function name.");
|
|
markInitialized();
|
|
function(TYPE_FUNCTION, blockWidth);
|
|
defineVariable(global);
|
|
}
|
|
|
|
static int emitJump(uint8_t opcode) {
|
|
emitByte(opcode);
|
|
emitBytes(0xFF, 0xFF);
|
|
return currentChunk()->count - 2;
|
|
}
|
|
|
|
static void patchJump(int offset) {
|
|
int jump = currentChunk()->count - offset - 2;
|
|
if (jump > 0xFFFF) {
|
|
error("Unsupported far jump (we'll get there)");
|
|
}
|
|
|
|
currentChunk()->code[offset] = (jump >> 8) & 0xFF;
|
|
currentChunk()->code[offset + 1] = (jump) & 0xFF;
|
|
}
|
|
|
|
static void emitLoop(int loopStart) {
|
|
emitByte(OP_LOOP);
|
|
int offset = currentChunk()->count - loopStart + 2;
|
|
if (offset > 0xFFFF) error("offset too big");
|
|
emitBytes(offset >> 8, offset);
|
|
}
|
|
|
|
static void ifStatement() {
|
|
/* Figure out what block level contains us so we can match our partner else */
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
|
|
/* Collect the if token that started this statement */
|
|
advance();
|
|
|
|
/* Collect condition expression */
|
|
expression();
|
|
|
|
/* if EXPR: */
|
|
consume(TOKEN_COLON, "Expect ':' after condition.");
|
|
|
|
int thenJump = emitJump(OP_JUMP_IF_FALSE);
|
|
emitByte(OP_POP);
|
|
|
|
/* Start a new scope and enter a block */
|
|
beginScope();
|
|
block(blockWidth,"if");
|
|
endScope();
|
|
|
|
int elseJump = emitJump(OP_JUMP);
|
|
patchJump(thenJump);
|
|
emitByte(OP_POP);
|
|
|
|
/* See if we have a matching else block */
|
|
if (blockWidth == 0 || (check(TOKEN_INDENTATION) && (parser.current.length == blockWidth))) {
|
|
/* This is complicated */
|
|
KrkToken previous;
|
|
if (blockWidth) {
|
|
previous = parser.previous;
|
|
advance();
|
|
}
|
|
if (match(TOKEN_ELSE)) {
|
|
/* TODO ELIF or ELSE IF */
|
|
consume(TOKEN_COLON, "Expect ':' after else.");
|
|
beginScope();
|
|
block(blockWidth,"else");
|
|
endScope();
|
|
} else {
|
|
if (!check(TOKEN_EOF) && !check(TOKEN_EOL)) {
|
|
krk_ungetToken(parser.current);
|
|
parser.current = parser.previous;
|
|
if (blockWidth) {
|
|
parser.previous = previous;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
patchJump(elseJump);
|
|
}
|
|
|
|
static void whileStatement() {
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
advance();
|
|
|
|
int loopStart = currentChunk()->count;
|
|
|
|
expression();
|
|
consume(TOKEN_COLON, "Expect ':' after condition.");
|
|
|
|
int exitJump = emitJump(OP_JUMP_IF_FALSE);
|
|
emitByte(OP_POP);
|
|
|
|
beginScope();
|
|
block(blockWidth,"while");
|
|
endScope();
|
|
|
|
emitLoop(loopStart);
|
|
|
|
patchJump(exitJump);
|
|
emitByte(OP_POP);
|
|
}
|
|
|
|
static void forStatement() {
|
|
/* I'm not sure if I want this to be more like Python or C/Lox/etc. */
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
advance();
|
|
|
|
/* For now this is going to be kinda broken */
|
|
beginScope();
|
|
|
|
ssize_t loopInd = current->localCount;
|
|
varDeclaration();
|
|
|
|
int loopStart;
|
|
int exitJump;
|
|
|
|
if (match(TOKEN_IN)) {
|
|
defineVariable(loopInd);
|
|
|
|
KrkToken _it = syntheticToken("__loop_iter");
|
|
KrkToken _iter = syntheticToken("__iter__");
|
|
size_t indLoopIter = current->localCount;
|
|
|
|
/* __loop_iter = */
|
|
addLocal(_it);
|
|
defineVariable(indLoopIter);
|
|
|
|
/* ITERABLE.__iter__() */
|
|
expression();
|
|
ssize_t ind = identifierConstant(&_iter);
|
|
EMIT_CONSTANT_OP(OP_GET_PROPERTY, ind);
|
|
emitBytes(OP_CALL, 0);
|
|
|
|
/* assign */
|
|
EMIT_CONSTANT_OP(OP_SET_LOCAL, indLoopIter);
|
|
|
|
/* LOOP STARTS HERE */
|
|
loopStart = currentChunk()->count;
|
|
|
|
/* Call the iterator */
|
|
EMIT_CONSTANT_OP(OP_GET_LOCAL, indLoopIter);
|
|
emitBytes(OP_CALL, 0);
|
|
|
|
/* Assign the result to our loop index */
|
|
EMIT_CONSTANT_OP(OP_SET_LOCAL, loopInd);
|
|
|
|
/* Get the loop iterator again */
|
|
EMIT_CONSTANT_OP(OP_GET_LOCAL, indLoopIter);
|
|
emitByte(OP_EQUAL);
|
|
emitByte(OP_NOT);
|
|
exitJump = emitJump(OP_JUMP_IF_FALSE);
|
|
emitByte(OP_POP);
|
|
|
|
} else {
|
|
consume(TOKEN_COMMA,"expect ,");
|
|
loopStart = currentChunk()->count;
|
|
|
|
|
|
expression(); /* condition */
|
|
exitJump = emitJump(OP_JUMP_IF_FALSE);
|
|
emitByte(OP_POP);
|
|
|
|
if (check(TOKEN_COMMA)) {
|
|
advance();
|
|
int bodyJump = emitJump(OP_JUMP);
|
|
int incrementStart = currentChunk()->count;
|
|
expression();
|
|
emitByte(OP_POP);
|
|
|
|
emitLoop(loopStart);
|
|
loopStart = incrementStart;
|
|
patchJump(bodyJump);
|
|
}
|
|
}
|
|
|
|
consume(TOKEN_COLON,"expect :");
|
|
|
|
beginScope();
|
|
block(blockWidth,"for");
|
|
endScope();
|
|
|
|
emitLoop(loopStart);
|
|
patchJump(exitJump);
|
|
emitByte(OP_POP);
|
|
endScope();
|
|
}
|
|
|
|
static void returnStatement() {
|
|
if (match(TOKEN_EOL) || match(TOKEN_EOF)) {
|
|
emitReturn();
|
|
} else {
|
|
if (current->type == TYPE_INIT) {
|
|
error("Can not return values from __init__");
|
|
}
|
|
expression();
|
|
emitByte(OP_RETURN);
|
|
}
|
|
}
|
|
|
|
static void tryStatement() {
|
|
size_t blockWidth = (parser.previous.type == TOKEN_INDENTATION) ? parser.previous.length : 0;
|
|
advance();
|
|
consume(TOKEN_COLON, "Expect ':' after try.");
|
|
|
|
/* Make sure we are in a local scope so this ends up on the stack */
|
|
beginScope();
|
|
int tryJump = emitJump(OP_PUSH_TRY);
|
|
addLocal(syntheticToken("exception"));
|
|
defineVariable(0);
|
|
|
|
beginScope();
|
|
block(blockWidth,"try");
|
|
endScope();
|
|
|
|
int successJump = emitJump(OP_JUMP);
|
|
patchJump(tryJump);
|
|
|
|
if (blockWidth == 0 || (check(TOKEN_INDENTATION) && (parser.current.length == blockWidth))) {
|
|
KrkToken previous;
|
|
if (blockWidth) {
|
|
previous = parser.previous;
|
|
advance();
|
|
}
|
|
if (match(TOKEN_EXCEPT)) {
|
|
consume(TOKEN_COLON, "Expect ':' after except.");
|
|
beginScope();
|
|
block(blockWidth,"except");
|
|
endScope();
|
|
} else if (!check(TOKEN_EOL) && !check(TOKEN_EOF)) {
|
|
krk_ungetToken(parser.current);
|
|
parser.current = parser.previous;
|
|
if (blockWidth) {
|
|
parser.previous = previous;
|
|
}
|
|
}
|
|
}
|
|
|
|
patchJump(successJump);
|
|
endScope(); /* will pop the exception handler */
|
|
}
|
|
|
|
static void raiseStatement() {
|
|
expression();
|
|
emitByte(OP_RAISE);
|
|
}
|
|
|
|
static void importStatement() {
|
|
consume(TOKEN_IDENTIFIER, "Expected module name");
|
|
declareVariable();
|
|
size_t ind = identifierConstant(&parser.previous);
|
|
EMIT_CONSTANT_OP(OP_IMPORT, ind);
|
|
defineVariable(ind);
|
|
}
|
|
|
|
static void exportStatement() {
|
|
do {
|
|
consume(TOKEN_IDENTIFIER, "only named variable may be exported to the global namespace");
|
|
namedVariable(parser.previous, 0);
|
|
namedVariable(parser.previous, 0);
|
|
size_t ind = identifierConstant(&parser.previous);
|
|
EMIT_CONSTANT_OP(OP_DEFINE_GLOBAL, ind);
|
|
EMIT_CONSTANT_OP(OP_SET_GLOBAL, ind);
|
|
emitByte(OP_POP);
|
|
} while (match(TOKEN_COMMA));
|
|
}
|
|
|
|
static void statement() {
|
|
if (match(TOKEN_EOL) || match(TOKEN_EOF)) {
|
|
return; /* Meaningless blank line */
|
|
}
|
|
|
|
if (check(TOKEN_IF)) {
|
|
ifStatement();
|
|
} else if (check(TOKEN_WHILE)) {
|
|
whileStatement();
|
|
} else if (check(TOKEN_FOR)) {
|
|
forStatement();
|
|
} else if (check(TOKEN_TRY)) {
|
|
tryStatement();
|
|
} else {
|
|
if (match(TOKEN_PRINT)) {
|
|
printStatement();
|
|
} else if (match(TOKEN_EXPORT)) {
|
|
exportStatement();
|
|
} else if (match(TOKEN_RAISE)) {
|
|
raiseStatement();
|
|
} else if (match(TOKEN_RETURN)) {
|
|
returnStatement();
|
|
} else if (match(TOKEN_IMPORT)) {
|
|
importStatement();
|
|
} else {
|
|
expressionStatement();
|
|
}
|
|
if (!match(TOKEN_EOL) && !match(TOKEN_EOF)) {
|
|
errorAtCurrent("Unexpected token after statement.");
|
|
}
|
|
}
|
|
}
|
|
|
|
static void grouping(int canAssign) {
|
|
expression();
|
|
consume(TOKEN_RIGHT_PAREN, "Expect ')' after expression.");
|
|
}
|
|
|
|
static void unary(int canAssign) {
|
|
KrkTokenType operatorType = parser.previous.type;
|
|
|
|
parsePrecedence(PREC_UNARY);
|
|
|
|
switch (operatorType) {
|
|
case TOKEN_MINUS: emitByte(OP_NEGATE); break;
|
|
|
|
/* These are equivalent */
|
|
case TOKEN_BANG:
|
|
case TOKEN_NOT:
|
|
emitByte(OP_NOT);
|
|
break;
|
|
|
|
default: return;
|
|
}
|
|
}
|
|
|
|
static void string(int canAssign) {
|
|
/* We'll just build with a flexible array like everything else. */
|
|
size_t stringCapacity = 0;
|
|
size_t stringLength = 0;
|
|
char * stringBytes = 0;
|
|
#define PUSH_CHAR(c) do { if (stringCapacity < stringLength + 1) { \
|
|
size_t old = stringCapacity; stringCapacity = GROW_CAPACITY(old); \
|
|
stringBytes = GROW_ARRAY(char, stringBytes, old, stringCapacity); \
|
|
} stringBytes[stringLength++] = c; } while (0)
|
|
|
|
/* This should capture everything but the quotes. */
|
|
const char * c = parser.previous.start + 1;
|
|
while (c < parser.previous.start + parser.previous.length -1) {
|
|
if (*c == '\\') {
|
|
switch (c[1]) {
|
|
case 'n': PUSH_CHAR('\n'); break;
|
|
case 'r': PUSH_CHAR('\r'); break;
|
|
case 't': PUSH_CHAR('\t'); break;
|
|
case '[': PUSH_CHAR('\033'); break;
|
|
default: PUSH_CHAR(c[1]); break;
|
|
}
|
|
c += 2;
|
|
} else {
|
|
PUSH_CHAR(*c);
|
|
c++;
|
|
}
|
|
}
|
|
emitConstant(OBJECT_VAL(krk_copyString(stringBytes,stringLength)));
|
|
FREE_ARRAY(char,stringBytes,stringCapacity);
|
|
}
|
|
|
|
static void codepoint(int canAssign) {
|
|
const char * c = parser.previous.start + 1;
|
|
size_t width = 0;
|
|
int codepoint = 0;
|
|
while (c < parser.previous.start + parser.previous.length - 1) {
|
|
if (width >= 1) {
|
|
error("Wide character literals are not currently supported.");
|
|
return;
|
|
}
|
|
if (*c == '\\') {
|
|
switch (c[1]) {
|
|
case 'n': codepoint = '\n'; break;
|
|
case 'r': codepoint = '\r'; break;
|
|
case 't': codepoint = '\t'; break;
|
|
case '[': codepoint = '\033'; break;
|
|
default: codepoint = c[1]; break;
|
|
}
|
|
width++;
|
|
c += 2;
|
|
} else {
|
|
codepoint = *c;
|
|
width++;
|
|
c++;
|
|
}
|
|
}
|
|
emitConstant(INTEGER_VAL(codepoint));
|
|
}
|
|
|
|
static size_t addUpvalue(Compiler * compiler, ssize_t index, int isLocal) {
|
|
size_t upvalueCount = compiler->function->upvalueCount;
|
|
for (size_t i = 0; i < upvalueCount; ++i) {
|
|
Upvalue * upvalue = &compiler->upvalues[i];
|
|
if ((ssize_t)upvalue->index == index && upvalue->isLocal == isLocal) {
|
|
return i;
|
|
}
|
|
}
|
|
if (upvalueCount == MAX_LOCALS) {
|
|
error("Too many closure variables in function.");
|
|
return 0;
|
|
}
|
|
compiler->upvalues[upvalueCount].isLocal = isLocal;
|
|
compiler->upvalues[upvalueCount].index = index;
|
|
return compiler->function->upvalueCount++;
|
|
}
|
|
|
|
static ssize_t resolveUpvalue(Compiler * compiler, KrkToken * name) {
|
|
if (compiler->enclosing == NULL) return -1;
|
|
ssize_t local = resolveLocal(compiler->enclosing, name);
|
|
if (local != -1) {
|
|
compiler->enclosing->locals[local].isCaptured = 1;
|
|
return addUpvalue(compiler, local, 1);
|
|
}
|
|
ssize_t upvalue = resolveUpvalue(compiler->enclosing, name);
|
|
if (upvalue != -1) {
|
|
return addUpvalue(compiler, upvalue, 0);
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
#define DO_VARIABLE(opset,opget) do { \
|
|
if (canAssign && match(TOKEN_EQUAL)) { \
|
|
expression(); \
|
|
EMIT_CONSTANT_OP(opset, arg); \
|
|
} else { \
|
|
EMIT_CONSTANT_OP(opget, arg); \
|
|
} } while (0)
|
|
|
|
static void namedVariable(KrkToken name, int canAssign) {
|
|
ssize_t arg = resolveLocal(current, &name);
|
|
if (arg != -1) {
|
|
DO_VARIABLE(OP_SET_LOCAL, OP_GET_LOCAL);
|
|
} else if ((arg = resolveUpvalue(current, &name)) != -1) {
|
|
DO_VARIABLE(OP_SET_UPVALUE, OP_GET_UPVALUE);
|
|
} else {
|
|
arg = identifierConstant(&name);
|
|
DO_VARIABLE(OP_SET_GLOBAL, OP_GET_GLOBAL);
|
|
}
|
|
}
|
|
#undef DO_VARIABLE
|
|
|
|
static void variable(int canAssign) {
|
|
namedVariable(parser.previous, canAssign);
|
|
}
|
|
|
|
static void self(int canAssign) {
|
|
if (currentClass == NULL) {
|
|
error("Invalid reference to `self` outside of a class method.");
|
|
return;
|
|
}
|
|
variable(0);
|
|
}
|
|
|
|
static void super_(int canAssign) {
|
|
if (currentClass == NULL) {
|
|
error("Invalid reference to `super` outside of a class.");
|
|
} else if (!currentClass->hasSuperClass) {
|
|
error("Invalid reference to `super` from a base class.");
|
|
}
|
|
consume(TOKEN_LEFT_PAREN, "Expected `super` to be called.");
|
|
consume(TOKEN_RIGHT_PAREN, "`super` can not take arguments.");
|
|
consume(TOKEN_DOT, "Expected a field of `super()` to be referenced.");
|
|
consume(TOKEN_IDENTIFIER, "Expected a field name.");
|
|
size_t ind = identifierConstant(&parser.previous);
|
|
namedVariable(syntheticToken("self"), 0);
|
|
namedVariable(syntheticToken("super"), 0);
|
|
EMIT_CONSTANT_OP(OP_GET_SUPER, ind);
|
|
}
|
|
|
|
static void list(int canAssign) {
|
|
KrkToken listOf = syntheticToken("listOf");
|
|
size_t ind = identifierConstant(&listOf);
|
|
EMIT_CONSTANT_OP(OP_GET_GLOBAL, ind);
|
|
size_t argCount = 0;
|
|
if (!check(TOKEN_RIGHT_SQUARE)) {
|
|
do {
|
|
expression();
|
|
/* TOKEN_FOR for comprehensions? */
|
|
if (argCount == 255) error("Too many values in list expression.");
|
|
argCount++;
|
|
} while (match(TOKEN_COMMA));
|
|
}
|
|
consume(TOKEN_RIGHT_SQUARE,"Expected ] at end of list expression.");
|
|
emitBytes(OP_CALL, argCount);
|
|
}
|
|
|
|
static void dict(int canAssign) {
|
|
KrkToken dictOf = syntheticToken("dictOf");
|
|
size_t ind = identifierConstant(&dictOf);
|
|
EMIT_CONSTANT_OP(OP_GET_GLOBAL, ind);
|
|
size_t argCount = 0;
|
|
if (!check(TOKEN_RIGHT_BRACE)) {
|
|
do {
|
|
expression();
|
|
consume(TOKEN_COLON, "Expect colon after dict key.");
|
|
expression();
|
|
argCount += 2;
|
|
if (argCount == 254) error("Too many pairs in dict expression.");
|
|
} while (match(TOKEN_COMMA));
|
|
}
|
|
consume(TOKEN_RIGHT_BRACE,"Expected } at end of dict expression.");
|
|
emitBytes(OP_CALL, argCount);
|
|
}
|
|
|
|
#define RULE(token, a, b, c) [token] = {# token, a, b, c}
|
|
|
|
ParseRule rules[] = {
|
|
RULE(TOKEN_LEFT_PAREN, grouping, call, PREC_CALL),
|
|
RULE(TOKEN_RIGHT_PAREN, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_LEFT_BRACE, dict, NULL, PREC_NONE),
|
|
RULE(TOKEN_RIGHT_BRACE, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_LEFT_SQUARE, list, get_, PREC_CALL),
|
|
RULE(TOKEN_RIGHT_SQUARE, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_COLON, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_COMMA, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_DOT, NULL, dot, PREC_CALL),
|
|
RULE(TOKEN_MINUS, unary, binary, PREC_TERM),
|
|
RULE(TOKEN_PLUS, NULL, binary, PREC_TERM),
|
|
RULE(TOKEN_SEMICOLON, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_SOLIDUS, NULL, binary, PREC_FACTOR),
|
|
RULE(TOKEN_ASTERISK, NULL, binary, PREC_FACTOR),
|
|
RULE(TOKEN_MODULO, NULL, binary, PREC_FACTOR),
|
|
RULE(TOKEN_BANG, unary, NULL, PREC_NONE),
|
|
RULE(TOKEN_BANG_EQUAL, NULL, binary, PREC_EQUALITY),
|
|
RULE(TOKEN_EQUAL, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_EQUAL_EQUAL, NULL, binary, PREC_EQUALITY),
|
|
RULE(TOKEN_GREATER, NULL, binary, PREC_COMPARISON),
|
|
RULE(TOKEN_GREATER_EQUAL, NULL, binary, PREC_COMPARISON),
|
|
RULE(TOKEN_LESS, NULL, binary, PREC_COMPARISON),
|
|
RULE(TOKEN_LESS_EQUAL, NULL, binary, PREC_COMPARISON),
|
|
RULE(TOKEN_IDENTIFIER, variable, NULL, PREC_NONE),
|
|
RULE(TOKEN_STRING, string, NULL, PREC_NONE),
|
|
RULE(TOKEN_NUMBER, number, NULL, PREC_NONE),
|
|
RULE(TOKEN_CODEPOINT, codepoint,NULL, PREC_NONE), /* TODO */
|
|
RULE(TOKEN_AND, NULL, and_, PREC_AND),
|
|
RULE(TOKEN_CLASS, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_ELSE, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_FALSE, literal, NULL, PREC_NONE),
|
|
RULE(TOKEN_FOR, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_DEF, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_IF, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_IN, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_LET, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_NONE, literal, NULL, PREC_NONE),
|
|
RULE(TOKEN_NOT, unary, NULL, PREC_NONE),
|
|
RULE(TOKEN_OR, NULL, or_, PREC_OR),
|
|
RULE(TOKEN_PRINT, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_RETURN, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_SELF, self, NULL, PREC_NONE),
|
|
RULE(TOKEN_SUPER, super_, NULL, PREC_NONE),
|
|
RULE(TOKEN_TRUE, literal, NULL, PREC_NONE),
|
|
RULE(TOKEN_WHILE, NULL, NULL, PREC_NONE),
|
|
|
|
/* This is going to get interesting */
|
|
RULE(TOKEN_INDENTATION, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_ERROR, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_EOL, NULL, NULL, PREC_NONE),
|
|
RULE(TOKEN_EOF, NULL, NULL, PREC_NONE),
|
|
};
|
|
|
|
static void parsePrecedence(Precedence precedence) {
|
|
advance();
|
|
ParseFn prefixRule = getRule(parser.previous.type)->prefix;
|
|
if (prefixRule == NULL) {
|
|
errorAtCurrent("expect expression");
|
|
return;
|
|
}
|
|
int canAssign = precedence <= PREC_ASSIGNMENT;
|
|
prefixRule(canAssign);
|
|
while (precedence <= getRule(parser.current.type)->precedence) {
|
|
advance();
|
|
ParseFn infixRule = getRule(parser.previous.type)->infix;
|
|
infixRule(canAssign);
|
|
}
|
|
|
|
if (canAssign && match(TOKEN_EQUAL)) {
|
|
error("invalid assignment target");
|
|
}
|
|
}
|
|
|
|
static ssize_t identifierConstant(KrkToken * name) {
|
|
return krk_addConstant(currentChunk(), OBJECT_VAL(krk_copyString(name->start, name->length)));
|
|
}
|
|
|
|
static ssize_t resolveLocal(Compiler * compiler, KrkToken * name) {
|
|
for (ssize_t i = compiler->localCount - 1; i >= 0; i--) {
|
|
Local * local = &compiler->locals[i];
|
|
if (identifiersEqual(name, &local->name)) {
|
|
if (local->depth == -1) {
|
|
error("can not initialize value recursively (are you shadowing something?)");
|
|
}
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
static void addLocal(KrkToken name) {
|
|
if (current->localCount == MAX_LOCALS) {
|
|
error("too many locals");
|
|
return;
|
|
}
|
|
Local * local = ¤t->locals[current->localCount++];
|
|
local->name = name;
|
|
local->depth = -1;
|
|
local->isCaptured = 0;
|
|
}
|
|
|
|
static void declareVariable() {
|
|
if (current->scopeDepth == 0) return;
|
|
KrkToken * name = &parser.previous;
|
|
/* Detect duplicate definition */
|
|
for (ssize_t i = current->localCount - 1; i >= 0; i--) {
|
|
Local * local = ¤t->locals[i];
|
|
if (local->depth != -1 && local->depth < (ssize_t)current->scopeDepth) break;
|
|
if (identifiersEqual(name, &local->name)) error("Duplicate definition");
|
|
}
|
|
addLocal(*name);
|
|
}
|
|
|
|
static ssize_t parseVariable(const char * errorMessage) {
|
|
consume(TOKEN_IDENTIFIER, errorMessage);
|
|
|
|
declareVariable();
|
|
if (current->scopeDepth > 0) return 0;
|
|
|
|
return identifierConstant(&parser.previous);
|
|
}
|
|
|
|
static void defineVariable(size_t global) {
|
|
if (current->scopeDepth > 0) {
|
|
markInitialized();
|
|
return;
|
|
}
|
|
|
|
EMIT_CONSTANT_OP(OP_DEFINE_GLOBAL, global);
|
|
}
|
|
|
|
static uint8_t argumentList() {
|
|
uint8_t argCount = 0;
|
|
if (!check(TOKEN_RIGHT_PAREN)) {
|
|
do {
|
|
expression();
|
|
if (argCount == 255) error("Too many arguments to function."); // Need long call...
|
|
argCount++;
|
|
} while (match(TOKEN_COMMA));
|
|
}
|
|
consume(TOKEN_RIGHT_PAREN, "Expected ')' after arguments.");
|
|
return argCount;
|
|
}
|
|
|
|
static void and_(int canAssign) {
|
|
int endJump = emitJump(OP_JUMP_IF_FALSE);
|
|
emitByte(OP_POP);
|
|
parsePrecedence(PREC_AND);
|
|
patchJump(endJump);
|
|
}
|
|
|
|
static void or_(int canAssign) {
|
|
int endJump = emitJump(OP_JUMP_IF_TRUE);
|
|
emitByte(OP_POP);
|
|
parsePrecedence(PREC_OR);
|
|
patchJump(endJump);
|
|
}
|
|
|
|
static ParseRule * getRule(KrkTokenType type) {
|
|
return &rules[type];
|
|
}
|
|
|
|
KrkFunction * krk_compile(const char * src, int newScope, char * fileName) {
|
|
krk_initScanner(src);
|
|
Compiler compiler;
|
|
initCompiler(&compiler, TYPE_MODULE);
|
|
compiler.function->chunk.filename = krk_copyString(fileName, strlen(fileName));
|
|
|
|
if (newScope) beginScope();
|
|
|
|
parser.hadError = 0;
|
|
parser.panicMode = 0;
|
|
|
|
advance();
|
|
|
|
while (!match(TOKEN_EOF)) {
|
|
declaration();
|
|
if (check(TOKEN_EOL) || check(TOKEN_INDENTATION) || check(TOKEN_EOF)) {
|
|
/* There's probably already and error... */
|
|
advance();
|
|
}
|
|
}
|
|
|
|
KrkFunction * function = endCompiler();
|
|
return parser.hadError ? NULL : function;
|
|
}
|
|
|
|
void krk_markCompilerRoots() {
|
|
Compiler * compiler = current;
|
|
while (compiler != NULL) {
|
|
krk_markObject((KrkObj*)compiler->function);
|
|
compiler = compiler->enclosing;
|
|
}
|
|
}
|