DataStructures/test.sally at master · mpwellen/DataStructures · GitHub

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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185

// File: example1.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Basic test
//

."In FORTH, speak like Yoda we do"     // string literals between ." and "
.                                      // . prints top of the stack
CR                                     // prints carriage return
."Three plus five, what is?"
.
SP                            // prints a space character
3 5 +                         // computes the sum
.                             // prints the top of the stack again
CR
// File: example2.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Arithmetic operations test
// Prints 1, 2, 3, 4, 5


7 -6 + . CR

1 3 -  NEG . CR

9 3 / . CR

12 8 % . CR

3 4 * -3 NEG +  13 3 -  % . CR

// File: example3.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Stack manipulation test
//

15 DUP . SP . CR          // Prints 15 15

17 14 DROP . CR           // Prints 17

20 30 SWAP . SP  . CR     // Prints 20 30

1 3 2 ROT . SP . SP . CR  // Prints 1 2 3

// File: example4.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Testing variables
//


1 x SET             // x = 1
x @ . CR            // printf("%d\n", x) ;

x @ 1 + x !         // x = x + 1
x @ . CR            // printf("%d\n", x) ;

0 y SET             // y = 0
x @ 2 + y !         // y = x + 2
y @ . CR            // printf("%d\n", y) ;

// File: example5.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Testing comparison operatons
//
// Prints False, True, False, True...


17 13 <  . CR
17 23 <  . CR

35 31 <= . CR
31 31 <= . CR

91 19 == . CR
19 19 == . CR

19 19 != . CR
91 19 != . CR

37 43 >= . CR
43 43 >= . CR

61 75 >  . CR
95 75 >  . CR

// File: example6.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Testing logical connectors
//


12 x SET

."Truth table for AND" . CR
x @ 13 >=  x @ 11 <=   AND . CR
x @ 13 >=  x @ 20 <=   AND . CR
x @ 11 >=  x @  9 <=   AND . CR
x @ 10 >=  x @ 20 <=   AND . CR
CR

."Truth table for OR" . CR
x @ 13 >=  x @ 11 <=   OR . CR
x @ 13 >=  x @ 20 <=   OR . CR
x @ 11 >=  x @  9 <=   OR . CR
x @ 10 >=  x @ 20 <=   OR . CR
CR

."Truth table for NOT" . CR
x @ 15 >= NOT . CR
x @  5 >= NOT . CR

// File: example7.sally
//
// CMSC 341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Testing IFTHEN ELSE ENDIF
//

5 7 <
IFTHEN
   1 1 + 2 ==
   IFTHEN
      3 2 % 0 ==
      IFTHEN
        ."Math works" . CR
      ELSE
        ."Talk like Yoda, we do" . CR
      ENDIF
   ELSE
     ."Huh???" . CR
   ENDIF
ELSE
   1 1 + 3 ==
   IFTHEN
      ."Fake News Reported" . CR
   ELSE
      ."Caught ya lying" . CR
   ENDIF
ENDIF

// File: example8.sally
//
// CMSC341 Fall 2018 Project 2
//
// Sally FORTH source code
//
// Testing DO UNTIL loop
// prints 1 through 10 inclusive
//


0 j SET

DO

  j @ 1 + j !    // j++
  j @ . CR       // print j

j @ 10 >= UNTIL  // until j >= 10