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
|
-- Copyright (c) 1991-2002, The Numerical Algorithms Group Ltd.
-- All rights reserved.
-- Copyright (C) 2007-2010, 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 The Numerical Algorithms Group Ltd. 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.
import includer
import scanner
namespace BOOTTRAN
module pile
shoeFirstTokPosn t ==
shoeTokPosn CAAR t
shoeLastTokPosn t==
shoeTokPosn second t
shoePileColumn t==
rest shoeTokPosn CAAR t
-- s is a token-dq-stream
shoePileInsert (s)==
bStreamNull s => [[],:s]
toktype := shoeTokType CAAAR s
toktype = "LISP" or toktype = "LINE" => [[first s],:rest s]
a:=shoePileTree(-1,s)
[[a.2],:a.3]
shoePileTree(n,s)==
bStreamNull s => [false,n,[],s]
[h,t] := [first s,rest s]
hh := shoePileColumn h
hh > n => shoePileForests(h,hh,t)
[false,n,[],s]
eqshoePileTree(n,s)==
bStreamNull s => [false,n,[],s]
[h,t] := [first s,rest s]
hh := shoePileColumn h
hh = n => shoePileForests(h,hh,t)
[false,n,[],s]
shoePileForest(n,s)==
[b,hh,h,t] := shoePileTree(n,s)
b =>
[h1,t1]:=shoePileForest1(hh,t)
[[h,:h1],t1]
[[],s]
shoePileForest1(n,s)==
[b,n1,h,t] := eqshoePileTree(n,s)
b =>
[h1,t1]:=shoePileForest1(n,t)
[[h,:h1],t1]
[[],s]
shoePileForests(h,n,s)==
[h1,t1] := shoePileForest(n,s)
bStreamNull h1 => [true,n,h,s]
shoePileForests(shoePileCtree(h,h1),n,t1)
shoePileCtree(x,y) ==
dqAppend(x,shoePileCforest y)
-- only enshoePiles forests with >=2 trees
shoePileCforest x==
x = nil => []
rest x = nil => first x
a := first x
b := shoePileCoagulate(a,rest x)
rest b = nil => first b
shoeEnPile shoeSeparatePiles b
shoePileCoagulate(a,b)==
b = nil => [a]
c := first b
shoeTokPart CAAR c = "THEN" or shoeTokPart CAAR c = "ELSE" =>
shoePileCoagulate (dqAppend(a,c),rest b)
d := second a
e := shoeTokPart d
d is ["KEY",:.] and
(e has SHOEINF or e = "COMMA" or e = "SEMICOLON") =>
shoePileCoagulate(dqAppend(a,c),rest b)
[a,:shoePileCoagulate(c,rest b)]
shoeSeparatePiles x==
x = nil => []
rest x = nil => first x
a := first x
semicolon := dqUnit shoeTokConstruct("KEY", "BACKSET",shoeLastTokPosn a)
dqConcat [a,semicolon,shoeSeparatePiles rest x]
shoeEnPile x==
dqConcat [dqUnit shoeTokConstruct("KEY","SETTAB",shoeFirstTokPosn x),
x, _
dqUnit shoeTokConstruct("KEY","BACKTAB",shoeLastTokPosn x)]
|
