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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
typedef struct treeNode {
char pattern; // Character to match
int pos; // Position (index) relative to the first treeNode to match
int identity; // What happens when this treeNode is the last to be matched
// 0: Invalid match: Match pattern is most likely incomplete (or escaped)
// 1: italics delimiter
// 2: bold delimiter
// 3: bold&italics delimiter
// 4: inline code delimiter
// 5: code block delimiter
// 6: header 1 (h1) delimiter
// 7: header 2 (h2) delimiter
// 8: header delimiter
// 9: yaml intro delimiter
// 10: title
// 11: author
// 12: automatic date (date will be formatted for groff on compile time)
// 13: manual date
// 14: indent text
int childsize;
struct treeNode *child[]; // Pointer array to other child nodes
} node ;
node n_a = {
'*', 0, 1, 4,
{&n_aa, &n_ab, &n_ac, &n_ad}
};
node n_aa = {
'\\', -1, 0, 0,
{}
};
node n_ab = {
'*', 1, 2, 3,
{&n_aba, &n_abb, &n_abc}
};
node n_aba = {
'_', -1, 3, 0,
{}
};
node n_abb = {
'*', 2, 3, 0,
{}
};
node n_abc = {
'_', 2, 3, 0,
{}
};
node n_ac = {
'_', -1, 0, 1,
{&n_aca}
};
node n_aca = {
'_', -2, 3, 0,
{}
};
node n_ad = {
'_', 1, 0, 1,
{&n_ada}
};
node n_ada = {
'_', 2, 3, 0,
{}
};
node n_b = {
'_', 0, 1, 2,
{&n_ba, &n_bb}
};
node n_ba = {
'\\', -1, 0, 0,
{}
};
node n_bb = {
'_', 1, 0, 1,
{&n_bba}
};
node n_bba = {
'_', 2, 3, 0,
{}
};
node n_c = {
'`', 0, 4, 2,
{&n_ca, &n_cb}
};
node n_ca = {
'\\', -1, 0, 0,
{}
};
node n_cb = {
'`', 1, 0, 1,
{&n_cba}
};
node n_cba = {
'`', 2, 0, 1,
{&n_cbaa}
};
node n_cbaa = {
'\n', -1, 5, 0,
{}
};
node n_d = {
'\n', 0, 0, 6,
{&n_da, &n_db, &n_dc, &n_dd, &n_de, &n_df, }
};
node n_da = {
'#', 1, 8, 0,
{}
};
node n_db = {
'=', 1, 6, 0,
{}
};
node n_dc = {
'-', 1, 7, 0,
{}
};
node n_dd = {
'>', 1, 14, 0,
{}
};
node n_de = {
'-', -1, 0, 1,
{&n_dea}
};
node n_dea = {
'-', -2, 0, 1,
{&n_deaa}
};
node n_deaa = {
'-', -3, 9, 0,
{}
};
node n_df = {
't', 3, 0, 3,
{&n_dfa, &n_dfb, &n_dfc}
};
node n_dfa = {
'a', 1, 0, 1,
{&n_dfaa}
};
node n_dfaa = {
'u', 2, 0, 1,
{&n_dfaaa}
};
node n_dfaaa = {
'h', 4, 0, 1,
{&n_dfaaaa}
};
node n_dfaaaa = {
'o', 5, 0, 1,
{&n_dfaaaaa}
};
node n_dfaaaaa = {
'r', 6, 0, 1,
{&n_dfaaaaaa}
};
node &n_dfaaaaaa = {
':', 7, 11, 0,
{}
};
node n_dfb = {
'd', 1, 0, 1,
{&n_dfba}
};
node n_dfba = {
'a', 2, 0, 1,
{&n_dfbaa}
};
node n_dfbaa = {
'e', 4, 0, 2,
{&n_dfbaaa, &n_dfbaab}
};
node n_dfbaaa = {
':', 5, 13, 0,
{}
};
node n_dfbaab = {
'\n', 5, 12, 0,
{}
};
node n_dfc = {
't', 1, 0, 1,
{&n_dfca}
};
node n_dfca = {
'i', 2, 0, 1,
{&n_dfcaa}
};
node n_dfcaa = {
'l', 4, 0, 1,
{&n_dfcaaa}
};
node n_dfcaaa = {
'e', 5, 0, 1,
{&n_dfcaaaa}
};
node n_dfcaaaa = {
':', 6, 10, 0,
{}
};
|
