-
Notifications
You must be signed in to change notification settings - Fork 1
/
asttost.hpp
30 lines (25 loc) · 836 Bytes
/
asttost.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#ifndef ASTTOST_HPP
#define ASTTOST_HPP
#include <cstring>
#include <fstream>
#include <iostream>
#include <stack>
#include <list>
using namespace std;
// struct Node { // For the first child next sibling binary tree representation of nary trees.
// string label;
// struct Node* firstKid;
// struct Node* nextSibling;
// };
// extern stack<Node*> trees;
void convertFunctionForm(Node *functionFormNode);
void convertInfixOperator(Node *infixOperatorNode);
void convertLambdaExpression(Node *lambdaNode);
void convertRecExpression(Node *recNode);
void convertWhereExpression(Node *whereNode);
void convertWithinExpression(Node *withinNode);
void convertAndExpression(Node *andHeaderNode);
void convertLetExpression(Node *letNode);
void recursivelyStandardizeTree(Node *node);
void convertASTToStandardizedTree();
#endif