-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathRE_Tree.cpp
130 lines (115 loc) · 1.98 KB
/
RE_Tree.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include "RE_Tree.h"
#include <iostream>
#include <string>
using namespace std;
RE_Tree::RE_Tree(string str)
{
exp = str;
pos = 0;
currentChar = '\0';
root = nullptr;
toRE_Tree();
// print();
}
void RE_Tree::operator=(string str)
{
delete root;
exp = str;
pos = 0;
currentChar = '\0';
root = nullptr;
toRE_Tree();
// print();
}
RE_Tree::~RE_Tree()
{
delete root;
}
void RE_Tree::toRE_Tree()
{
currentChar = getNextChar();
if (currentChar == '\0')
return;
root = parse_exp();
}
void RE_Tree::print()
{
cout << "ÕýÔò±í´ïʽÊ÷Ϊ: " << endl;
printTree(root);
}
char RE_Tree::getNextChar()
{
return exp[pos++];
}
RE_TreeNode * RE_Tree::parse_exp()
{
RE_TreeNode *t = parse_A();
while (currentChar == '|')
{
currentChar = getNextChar();
RE_TreeNode *p = parse_A();
RE_TreeNode *alt = new RE_TreeNode(ALT, '|', t, p);
t = alt;
}
return t;
}
RE_TreeNode * RE_Tree::parse_A()
{
RE_TreeNode *t = parse_B();
if (currentChar == '\0')
return t;
while (currentChar == '(' || isalpha(currentChar))
{
RE_TreeNode *p = parse_B();
RE_TreeNode *add = new RE_TreeNode(CONCAT, '+', t, p);
t = add;
}
return t;
}
RE_TreeNode * RE_Tree::parse_B()
{
RE_TreeNode *t = parse_C();
if (currentChar == '\0')
return t;
while (currentChar == '*')
{
currentChar = getNextChar();
RE_TreeNode *kleene = new RE_TreeNode(CLOSURE, '*', t, nullptr);
t = kleene;
}
return t;
}
RE_TreeNode * RE_Tree::parse_C()
{
RE_TreeNode *t = nullptr;
if (currentChar == '(')
{
currentChar = getNextChar();
t = parse_exp();
currentChar = getNextChar();
}
else
{
t = new RE_TreeNode(Element, currentChar, nullptr, nullptr);
currentChar = getNextChar();
}
return t;
}
RE_TreeNode *RE_Tree::getTreeRoot()
{
return root;
}
void RE_Tree::printTree(RE_TreeNode *tree)
{
static int indentno = 0;
indentno += 2;
if (tree != nullptr)
{
for (int i = 0; i < indentno; i++)
cout << " ";
cout << tree->ch << endl;
printTree(tree->child[0]);
printTree(tree->child[1]);
}
indentno -= 2;
}