oyvindskaaden
/
TDT4205
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

removed comment

main
Øyvind Skaaden 2022-02-27 19:15:12 +01:00
parent 9cd417d5da
commit 6b3065fe11
1 changed files with 0 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
exercises/03/vslc/src/tree.c
View File

@ -291,37 +291,6 @@ flatten(node_t **simplified, node_t *root)
static void
simplify_tree ( node_t **simplified, node_t *root )
{
/* TODO: Simplify the syntax tree structure
1. prune children: Delete nodes which can only ever have 1 child and no
meaningful data, and associate their child directly with their parent.
2. resolve constant expressions: Compute the value of subtrees representing
arithmetic with constants, and replace them with their value.
3. flatten: Delete internal nodes of list structures, leaving only a parent
node with a list type, and all list items as its children. Print list items
can be associated directly with the print statement.
VARIABLE_LIST VARIABLE_LIST
VARIABLE_LIST IDENTIFIER_DATA(i)
VARIABLE_LIST IDENTIFIER_DATA(j)
VARIABLE_LIST IDENTIFIER_DATA(k)
VARIABLE_LIST IDENTIFIER_DATA(l)
IDENTIFIER_DATA(i) becomes IDENTIFIER_DATA(m)
IDENTIFIER_DATA(j)
IDENTIFIER_DATA(k)
IDENTIFIER_DATA(l)
IDENTIFIER_DATA(m)
Tip: implement these three steps as separate functions to complete one task
at the time. e.g.:
prune_children(root);
redolve_constant_expressions(root);
flatten(root);
simplified = &root->children[0];
node_finalize(root);
*/
if (!root)
return;