import jinja2
-import parsing
import transformation
ENV = jinja2.Environment(
)
def generate_symbol_expression(c_symbol_expression):
- return 'Environment_get(environment, Runtime_symbol(runtime, "{}"))'.format(c_symbol_expression.value)
+ return 'Environment_get(environment, SYMBOL_LIST[{}] /* symbol: {} */)'.format(
+ c_symbol_expression.symbol_list_index,
+ c_symbol_expression.symbol,
+ )
def generate_expression(c_argument):
if isinstance(c_argument, transformation.CNegationExpression):
return '{};'.format(generate_expression(c_function_call_statement))
def generate_assignment_statement(c_assignment_statement):
- return 'Environment_set(environment, Runtime_symbol(runtime, "{}"), {});'.format(
+ return 'Environment_set(environment, SYMBOL_LIST[{}] /* symbol: {} */, {});'.format(
+ c_assignment_statement.target_symbol_list_index,
c_assignment_statement.target,
generate_expression(c_assignment_statement.expression),
)
def generate(c_program):
template = ENV.get_template('program.c')
return template.render(
- MAX_SYMBOL_LENGTH=parsing.MAX_SYMBOL_LENGTH,
builtins=list(sorted(c_program.builtins)),
statements=[generate_statement(statement) for statement in c_program.statements],
standard_libraries=list(sorted(c_program.standard_libraries)),
+ symbol_list=c_program.symbol_list,
)
if __name__ == '__main__':
import collections
-# TODO Check max symbol length in assignments, function calls, and symbol expressions
-MAX_SYMBOL_LENGTH = 16
-
def _or_parser(*parsers):
def result_parser(index, tokens):
failure = (False, index, None)
char* characters;
};
-#define MAX_SYMBOL_LENGTH {{ MAX_SYMBOL_LENGTH }}
-struct Symbol;
-typedef struct Symbol Symbol;
-struct Symbol
-{
- size_t length;
- char name[MAX_SYMBOL_LENGTH];
+const char * const SYMBOL_LIST[] = {
+{% for symbol in symbol_list %}
+ "{{ symbol }}",
+{% endfor %}
};
enum Type
typedef struct EnvironmentNode EnvironmentNode;
struct EnvironmentNode
{
- Symbol* key;
+ const char* key;
Object value;
EnvironmentNode* next;
};
EnvironmentNode* next;
for(EnvironmentNode* node = self->root; node != NULL; node = next)
{
- // We don't need to destruct the keys, because those will be destructed at the end when the Runtime is destructed
// We don't need to destruct the permanent strings, because those will be destructed at the end when the Runtime is destructed
- // The above two comments represent all heap-allocated objects currently, so we don't need to destruct Objects (yet)
+ // The above comment represents all heap-allocated objects currently, so we don't need to destruct Objects (yet)
next = node->next;
free(node);
}
}
// This need not be thread safe because environments exist on one thread only
-void Environment_set(Environment* self, Symbol* key, Object value)
+void Environment_set(Environment* self, const char* const key, Object value)
{
EnvironmentNode* node = malloc(sizeof(EnvironmentNode));
node->key = key;
self->root = node;
}
-Object Environment_get(Environment* self, Symbol* symbol)
+Object Environment_get(Environment* self, const char* const symbol)
{
for(EnvironmentNode* node = self->root; node != NULL; node = node->next)
{
- // We can compare pointers because pointers are unique within Runtime->symbols
+ // We can compare pointers because pointers are unique in the SYMBOLS_LIST
if(node->key == symbol)
{
return node->value;
}
-// TODO Allocate all symbols and strings as static constants so we can remove the level of indirection
struct Runtime
{
size_t permanentStringsLength;
size_t permanentStringsAllocated;
String** permanentStrings;
- size_t symbolsLength;
- size_t symbolsAllocated;
- Symbol** symbols;
};
Runtime* Runtime_construct()
result->permanentStringsLength = 0;
result->permanentStringsAllocated = 0;
result->permanentStrings = NULL;
- result->symbolsLength = 0;
- result->symbolsAllocated =0;
- result->symbols = NULL;
return result;
}
free(self->permanentStrings[i]);
}
- for(size_t i = 0; i < self->symbolsLength; i++)
- {
- free(self->symbols[i]);
- }
-
free(self->permanentStrings);
- free(self->symbols);
free(self);
}
self->permanentStringsLength++;
}
-// TODO Optimize this by sorting the symbols
-// TODO Make this function thread safe
-Symbol* Runtime_symbol(Runtime* self, const char* name)
-{
- assert(strlen(name) <= MAX_SYMBOL_LENGTH);
-
- for(size_t i = 0; i < self->symbolsLength; i++)
- {
- if(strcmp(self->symbols[i]->name, name) == 0)
- {
- return self->symbols[i];
- }
- }
-
- if(self->symbolsLength == self->symbolsAllocated)
- {
- if(self->symbolsAllocated == 0)
- {
- self->symbolsAllocated = 8;
- }
- else
- {
- self->symbolsAllocated = self->symbolsAllocated * 2;
- }
-
- self->symbols = realloc(
- self->symbols,
- sizeof(Symbol*) * self->symbolsAllocated
- );
-
- // TODO Handle realloc returning NULL
- }
-
- Symbol* result = malloc(sizeof(Symbol));
- result->length = strlen(name);
- strcpy(result->name, name);
-
- self->symbols[self->symbolsLength] = result;
- self->symbolsLength++;
-
- return result;
-}
-
Object integerLiteral(int32_t literal)
{
Object result;
CSymbolExpression = collections.namedtuple(
'CSymbolExpression',
[
- 'value',
+ 'symbol',
+ 'symbol_list_index',
],
)
'CAssignmentStatement',
[
'target',
+ 'target_symbol_list_index',
'expression',
],
)
'builtins',
'statements',
'standard_libraries',
+ 'symbol_list',
],
)
'print': ['stdio.h'],
}
-def transform_expression(builtin_dependencies, expression):
+def transform_expression(builtin_dependencies, symbol_list, expression):
if isinstance(expression, parsing.FurNegationExpression):
- return transform_negation_expression(builtin_dependencies, expression)
+ return transform_negation_expression(builtin_dependencies, symbol_list, expression)
if isinstance(expression, parsing.FurFunctionCallExpression):
- return transform_function_call_expression(builtin_dependencies, expression)
+ return transform_function_call_expression(builtin_dependencies, symbol_list, expression)
+
+ if isinstance(expression, parsing.FurSymbolExpression):
+ if expression.value not in symbol_list:
+ symbol_list.append(expression.value)
+
+ return CSymbolExpression(
+ symbol=expression.value,
+ symbol_list_index=symbol_list.index(expression.value),
+ )
LITERAL_TYPE_MAPPING = {
parsing.FurIntegerLiteralExpression: CIntegerLiteral,
parsing.FurStringLiteralExpression: CStringLiteral,
- parsing.FurSymbolExpression: CSymbolExpression,
}
if type(expression) in LITERAL_TYPE_MAPPING:
}
return INFIX_TYPE_MAPPING[type(expression)](
- left=transform_expression(builtin_dependencies, expression.left),
- right=transform_expression(builtin_dependencies, expression.right),
+ left=transform_expression(builtin_dependencies, symbol_list, expression.left),
+ right=transform_expression(builtin_dependencies, symbol_list, expression.right),
)
-def transform_assignment_statement(builtin_dependencies, assignment_statement):
+def transform_assignment_statement(builtin_dependencies, symbol_list, assignment_statement):
# TODO Check that target is not a builtin
+ if assignment_statement.target not in symbol_list:
+ symbol_list.append(assignment_statement.target)
+
return CAssignmentStatement(
target=assignment_statement.target,
- expression=transform_expression(builtin_dependencies, assignment_statement.expression),
+ target_symbol_list_index=symbol_list.index(assignment_statement.target),
+ expression=transform_expression(
+ builtin_dependencies,
+ symbol_list,
+ assignment_statement.expression,
+ ),
)
-def transform_negation_expression(builtin_dependencies, negation_expression):
- return CNegationExpression(value=transform_expression(builtin_dependencies, negation_expression.value))
+def transform_negation_expression(builtin_dependencies, symbol_list, negation_expression):
+ return CNegationExpression(
+ value=transform_expression(builtin_dependencies, symbol_list, negation_expression.value),
+ )
-def transform_function_call_expression(builtin_dependencies, function_call):
+def transform_function_call_expression(builtin_dependencies, symbol_list, function_call):
if function_call.function.value in BUILTINS.keys():
builtin_dependencies.add(function_call.function.value)
return CFunctionCallExpression(
name='builtin$' + function_call.function.value,
- arguments=tuple(transform_expression(builtin_dependencies, arg) for arg in function_call.arguments),
+ arguments=tuple(
+ transform_expression(builtin_dependencies, symbol_list, arg)
+ for arg in function_call.arguments
+ ),
)
raise Exception()
-def transform_statement(builtin_dependencies, statement):
+def transform_statement(builtin_dependencies, symbol_list, statement):
return {
parsing.FurAssignmentStatement: transform_assignment_statement,
parsing.FurFunctionCallExpression: transform_function_call_expression,
- }[type(statement)](builtin_dependencies, statement)
+ }[type(statement)](builtin_dependencies, symbol_list, statement)
def transform(program):
builtins = set()
+ symbol_list = []
c_statements = [
- transform_statement(builtins, statement) for statement in program.statement_list
+ transform_statement(builtins, symbol_list, statement) for statement in program.statement_list
]
standard_libraries = set()
builtins=builtins,
statements=c_statements,
standard_libraries=standard_libraries,
+ symbol_list=symbol_list,
)
projects / fur / commitdiff