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
|
/*
* Copyright 2015 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Colm.
*
* Colm is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Colm is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Colm; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "config.h"
#include "debug.h"
#include "pdarun.h"
#include "bytecode.h"
#include "tree.h"
#include "pool.h"
#include "internal.h"
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
//#define true 1
//#define false 0
void commit_clear_parse_tree( program_t *prg, tree_t **sp,
struct pda_run *pda_run, parse_tree_t *pt )
{
tree_t **top = vm_ptop();
if ( pt == 0 )
return;
free_tree:
if ( pt->next != 0 ) {
vm_push_ptree( pt->next );
}
if ( pt->left_ignore != 0 ) {
vm_push_ptree( pt->left_ignore );
}
if ( pt->child != 0 ) {
vm_push_ptree( pt->child );
}
if ( pt->right_ignore != 0 ) {
vm_push_ptree( pt->right_ignore );
}
if ( pt->shadow != 0 ) {
colm_tree_downref( prg, sp, pt->shadow->tree );
kid_free( prg, pt->shadow );
}
//printf( "commit_parse_tree_free %p\n", pt );
parse_tree_free( pda_run, pt );
/* Any trees to downref? */
if ( sp != top ) {
pt = vm_pop_ptree();
goto free_tree;
}
}
static int been_committed( parse_tree_t *parse_tree )
{
return parse_tree->flags & PF_COMMITTED;
}
void commit_clear( program_t *prg, tree_t **root, struct pda_run *pda_run )
{
tree_t **sp = root;
parse_tree_t *pt = pda_run->stack_top;
/* The top level of the stack is linked right to left. This is the
* traversal order we need for committing. */
while ( pt != 0 && !been_committed( pt ) ) {
vm_push_ptree( pt );
pt = pt->next;
}
while ( sp != root ) {
pt = vm_pop_ptree();
commit_clear_parse_tree( prg, sp, pda_run, pt->child );
pt->flags |= PF_COMMITTED;
pt = pt->next;
}
}
void commit_reduce( program_t *prg, tree_t **root, struct pda_run *pda_run )
{
tree_t **sp = root;
parse_tree_t *pt = pda_run->stack_top;
/* The top level of the stack is linked right to left. This is the
* traversal order we need for committing. */
while ( pt != 0 && !been_committed( pt ) ) {
vm_push_ptree( pt );
pt = pt->next;
}
while ( sp != root ) {
pt = vm_pop_ptree();
commit_forward_recurse( prg, sp, pda_run, pt );
pt->child = 0;
pt->flags |= PF_COMMITTED;
pt = pt->next;
}
}
|
