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
|
opcodes
note: no unary, increment, decrement
arthithmetic: + - * / %
bitwise: l r & | ^ ~
"<<" is l, ">>" is r
all are atoms or binary operators, so recursive compilation to a forth-like?
order of ops:
~
* / %
+ -
<< >>
&
^
|
final console interface:
#hashtag (exact) -> searches identica for tunes
@username (exact) -> parses identica feed for tunes
_1234... -> plays track from memory
expression -> compiles and plays expression
[else] -> searches greedily for a valid expression; if not found, ignores
bytetros?
void proc_token()
int[32] itable
struct { node* car, nlist* cdr } nlist
tlist* tcons(token*, )
struct { } token
token[140] ttable
struct { char type, int* iptr, int * } node
ntable[140]
int h2i(char*)
s-exp method:
tokenize: glom numbers
preparse: match parens, return s-expr
parse: turn into prefix notation
validate: check against rules
compile: optionally remove trivial identities ("~~") and evaluate static expressions
general method:
grammar parser, returns ast
----------
MACHINE:
struct { char type, char cval, int ival, node* lval, node* rval } node
types:
n number
v variable
b binary operator
u unary operator
SEXP
|
