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
|
// Copyright (C) 2011-2014, Gabriel Dos Reis.
// All rights reserved.
// Written by Gabriel Dos Reis.
//
// 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
#include <open-axiom/vm>
#include <iterator>
#include <algorithm>
#include <ostream>
namespace OpenAxiom {
namespace VM {
void Dynamic::Visitor::visit(const NullaryOperator& x) {
visit(as<FunctionBase>(x));
}
void Dynamic::Visitor::visit(const UnaryOperator& x) {
visit(as<FunctionBase>(x));
}
void Dynamic::Visitor::visit(const BinaryOperator& x) {
visit(as<FunctionBase>(x));
}
void FunctionBase::accept(Visitor& v) const { v.visit(*this); }
// -- Environement
Environment::Environment() = default;
Environment::~Environment() {
// Restore value of special variables bound in this environment.
const auto end = dynamic.rend();
for (auto p = dynamic.rbegin(); p != end; ++p)
p->symbol->value = p->value;
}
Environment::Binding*
Environment::lookup(InternedString name) {
for (auto& b : lexical) {
if (b.symbol->name == name)
return &b;
}
return nullptr;
}
// -- Dynamic
Dynamic::~Dynamic() = default;
// -- Symbol
Symbol::Symbol(InternedString s)
: name(s),
value(),
function(),
properties(),
package(),
attributes()
{ }
void Symbol::accept(Visitor& v) const { v.visit(*this); }
// -- Binding
void Binding::accept(Visitor& v) const { v.visit(*this); }
// -- Package
Package::Package(InternedString s)
: name(s)
{ }
Symbol*
Package::make_symbol(InternedString s) {
auto sym = const_cast<Symbol*>(&*symbols.insert(Symbol(s)).first);
sym->package = this;
return sym;
}
Symbol*
Package::find_symbol(InternedString s) {
auto p = symbols.find(Symbol(s));
return p == symbols.end() ? nullptr : const_cast<Symbol*>(&*p);
}
void Package::accept(Visitor& v) const { v.visit(*this); }
Fixnum
count_nodes(Pair p) {
FixnumBits n = 1;
for (; auto q = to_pair_if_can(p->tail); p = q)
++n;
return Fixnum(n);
}
// -- BasicContext --
Package*
BasicContext::make_package(InternedString n) {
auto p = &*packages.insert(Package(n)).first;
return const_cast<Package*>(p);
}
Symbol*
BasicContext::make_keyword(InternedString n) {
auto sym = keyword_package()->make_symbol(n);
sym->value = to_value(sym);
sym->attributes = SymbolAttribute::Keyword;
return sym;
}
Pair BasicContext::make_pair(Value h, Value t) {
return conses.make(h, t);
}
const NullaryOperator*
BasicContext::make_operator(Symbol* n, NullaryCode c) {
return setf_symbol_function(n, nullaries.make(n, c));
}
const UnaryOperator*
BasicContext::make_operator(Symbol* n, UnaryCode c) {
return setf_symbol_function(n, unaries.make(n, c));
}
const BinaryOperator*
BasicContext::make_operator(Symbol* n, BinaryCode c) {
return setf_symbol_function(n, binaries.make(n, c));
}
const TernaryOperator*
BasicContext::make_operator(Symbol* n, TernaryCode c) {
return setf_symbol_function(n, ternaries.make(n, c));
}
BasicContext::BasicContext()
: keywords(make_package(intern("KEYWORD"))),
homeless(make_package(nullptr))
{
}
BasicContext::~BasicContext() {
}
}
}
|
