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
|
-- Copyright (C) 2011, Gabriel Dos Reis.
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are
-- met:
--
-- - Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
--
-- - Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in
-- the documentation and/or other materials provided with the
-- distribution.
--
-- - Neither the name of OpenAxiom. nor the names of its contributors
-- may be used to endorse or promote products derived from this
-- software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
-- IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
-- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
-- OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-- EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-- PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
--%
--% Author: Gabriel Dos Reis
--%
import sys_-utility
namespace BOOT
module lexing
--%
--% Stack abstract datatype.
--% Operational semantics:
--% structure Stack ==
--% Record(store: List T, size: Integer, top: T, updated?: Boolean)
++ Construct a new stack
makeStack() ==
[nil,0,nil,false]
macro stackStore st ==
first st
macro stackSize st ==
second st
macro stackTop st ==
third st
macro stackUpdated? st ==
fourth st
stackLoad!(l,st) ==
stackStore(st) := l
stackSize(st) := #l
stackTop(st) := first l
stackClear! st ==
stackStore(st) := nil
stackSize(st) := 0
stackTop(st) := nil
stackUpdated?(st) := false
stackPush!(x,st) ==
stackStore(st) := [x,:stackStore st]
stackTop(st) := x
stackSize(st) := stackSize st + 1
stackUpdated?(st) := true
stackPop! st ==
y := first stackStore st
stackStore(st) := rest stackStore st
stackSize(st) := stackSize st - 1
if stackStore st ~= nil then
stackTop(st) := first stackStore st
y
--%
--% Parsing reduction stack
--%
--% Abstractly;
--% structure Reduction == Record(rule: RuleName, value: ParseTree)
--%
makeReduction(p == nil,v == nil) ==
[p,v]
macro reductionRule r ==
first r
macro reductionValue r ==
second r
++ stack of results of reduced productions
$reduceStack := makeStack()
pushReduction(rn,pt) ==
stackPush!(makeReduction(rn,pt),$reduceStack)
popReduction() ==
stackPop! $reduceStack
reduceStackClear() ==
stackClear! $reduceStack
popStack1() ==
reductionValue popReduction()
popStack2() ==
r1 := popReduction()
r2 := popReduction()
stackPush!(r1,$reduceStack)
reductionValue r2
popStack3() ==
r1 := popReduction()
r2 := popReduction()
r3 := popReduction()
stackPush!(r2,$reduceStack)
stackPush!(r1,$reduceStack)
reductionValue r3
popStack4() ==
r1 := popReduction()
r2 := popReduction()
r3 := popReduction()
r4 := popReduction()
stackPush!(r3,$reduceStack)
stackPush!(r2,$reduceStack)
stackPush!(r1,$reduceStack)
reductionValue r4
nthStack n ==
reductionValue stackStore($reduceStack).(n - 1)
|
