Files
kraken/stdlib/ast_transformation.krak

168 lines
3.7 KiB
Plaintext

import symbol:*
import tree:*
import vector:*
import stack:*
import map:*
import util:*
import string:*
import mem:*
import io:*
adt ast_node {
undef: undef,
translation_unit: translation_unit,
import: import,
identifier: identifier,
type_def: type_def,
adt_def: adt_def,
function: function,
code_block: code_block,
typed_parameter: typed_parameter,
expression: expression,
boolean_expression: boolean_expression,
statement: statement,
if_statement: if_statement,
match_statement: match_statement,
case_statement: case_statement,
while_loop: while_loop,
for_loop: for_loop,
return_statement: return_statement,
break_statement: break_statement,
continue_statement: continue_statement,
defer_statement: defer_statement,
assignment_statement: assignment_statement,
declaration_statement: declaration_statement,
if_comp: if_comp,
simple_passthrough: simple_passthrough,
passthrough_params: passthrough_params,
in_passthrough_params: in_passthrough_params,
out_passthrough_params: out_passthrough_params,
opt_string: opt_string,
param_assign: param_assign,
function_call: function_call,
value: value
}
obj undef (Object) {
}
obj translation_unit (Object) {
}
obj import (Object) {
}
obj identifier (Object) {
}
obj type_def (Object) {
}
obj adt_def (Object) {
}
obj function (Object) {
}
obj code_block (Object) {
}
obj typed_parameter (Object) {
}
obj expression (Object) {
}
obj boolean_expression (Object) {
}
obj statement (Object) {
}
obj if_statement (Object) {
}
obj match_statement (Object) {
}
obj case_statement (Object) {
}
obj while_loop (Object) {
}
obj for_loop (Object) {
}
obj return_statement (Object) {
}
obj break_statement (Object) {
}
obj continue_statement (Object) {
}
obj defer_statement (Object) {
}
obj assignment_statement (Object) {
}
obj declaration_statement (Object) {
}
obj if_comp (Object) {
}
obj simple_passthrough (Object) {
}
obj passthrough_params (Object) {
}
obj in_passthrough_params (Object) {
}
obj out_passthrough_params (Object) {
}
obj opt_string (Object) {
}
obj param_assign (Object) {
}
obj function_call (Object) {
}
obj value (Object) {
}
obj ast_transformation (Object) {
fun construct(): *ast_transformation {
return this
}
fun copy_construct(old: *ast_transformation) {
}
fun operator=(old: ref ast_transformation) {
destruct()
copy_construct(&old)
}
fun destruct() {
}
fun transform(parse_tree: *tree<symbol>): *ast_node {
return null<ast_node>()
}
}
fun get_ast_children(node: *ast_node): vector<*ast_node> {
return vector<*ast_node>()
}
fun get_ast_name(node: *ast_node): string {
return string("ast_node")
}
fun ast_to_dot(root: *ast_node): string {
var ret = string("digraph Kaken {\n")
var counter = 0
var node_name_map = map<*ast_node, string>()
var get_name = fun(node: *ast_node): string {
if (node_name_map.contains_key(node))
return node_name_map[node]
var escaped = string("")
get_ast_name(node).data.for_each(fun(c: char) {
if (c != '"')
escaped += c
else
escaped += "\\\""
})
escaped += to_string(counter++)
node_name_map.set(node, escaped)
return escaped
}
var helper: fun(*ast_node):void = fun(node: *ast_node) {
get_ast_children(node).for_each(fun(child: *ast_node) {
if (!child)
return; // where on earth does the null come from
ret += string("\"") + get_name(node) + "\" -> \"" + get_name(child) + "\"\n";
helper(child)
})
}
if (root)
helper(root)
return ret + "}"
}