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
|
/**
* Alee Forth: A portable and concise Forth implementation in modern C++.
* Copyright (C) 2023 Clyne Sullivan <clyne@bitgloo.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "dictionary.hpp"
#include <cctype>
Addr Dictionary::allot(Cell amount)
{
Addr old = here;
here += amount;
return old;
}
void Dictionary::add(Cell value)
{
write(allot(sizeof(Cell)), value);
}
Addr Dictionary::alignhere()
{
if (here & (sizeof(Cell) - sizeof(uint8_t)))
here = (here + sizeof(Cell)) & ~(sizeof(Cell) - sizeof(uint8_t));
return here;
}
void Dictionary::addDefinition(Word word)
{
add(word.size());
for (unsigned i = 0; i < word.size(); ++i)
writebyte(allot(1), readbyte(word.start + i));
}
bool Dictionary::issame(Addr addr, std::string_view str, std::size_t n)
{
if (str.size() != n)
return false;
for (char c : str) {
if (read(addr) != c)
return false;
addr += sizeof(Cell);
}
return true;
}
Addr Dictionary::find(Word word)
{
if (latest == 0)
return 0;
Addr lt = latest, oldlt;
do {
oldlt = lt;
const Cell l = read(lt);
const Addr len = l & 0x1F;
const Word lw {
static_cast<Addr>(lt + sizeof(Cell)),
static_cast<Addr>(lt + sizeof(Cell) + len)
};
if (equal(word, lw))
return lt;
else
lt -= l >> 6;
} while (lt != oldlt);
return 0;
}
Addr Dictionary::getexec(Addr addr)
{
const auto len = read(addr) & 0x1F;
return addr + sizeof(Cell) + len;
}
Word Dictionary::input()
{
const auto len = read(Dictionary::Input);
if (len == 0)
return {};
Addr wordstart = Dictionary::Input + sizeof(Cell) + Dictionary::InputCells
- len;
Addr wordend = wordstart;
auto cnt = len;
while (cnt) {
auto b = readbyte(wordend);
if (isspace(b) || b == '\0') {
if (wordstart != wordend) {
Word word {wordstart, wordend};
writebyte(Dictionary::Input, cnt - 1);
return word;
} else {
++wordstart;
}
}
++wordend;
--cnt;
}
return {};
}
bool Dictionary::equal(Word word, std::string_view sv) const
{
if (sv.size() != word.end - word.start)
return false;
for (unsigned i = 0; i < sv.size(); ++i) {
if (sv[i] != readbyte(word.start + i))
return false;
}
return true;
}
bool Dictionary::equal(Word word, Word other) const
{
if (word.size() != other.size())
return false;
for (unsigned i = 0; i < word.size(); ++i) {
if (readbyte(word.start + i) != readbyte(other.start + i))
return false;
}
return true;
}
|
