aboutsummaryrefslogtreecommitdiffstats
path: root/NOTES
diff options
context:
space:
mode:
authorbnewbold <bnewbold@robocracy.org>2012-12-19 18:40:20 +0100
committerbnewbold <bnewbold@robocracy.org>2012-12-19 18:40:20 +0100
commitff3a4e3ee0c27c38ca9a63a4fe6fe54221687e91 (patch)
treeef9d591646be4b0fb3ac4904686f2fad4b46b5a5 /NOTES
parentcd699af1e7d3e64556d2f9373db1d337cf14d2f5 (diff)
downloadbytetunes-ff3a4e3ee0c27c38ca9a63a4fe6fe54221687e91.tar.gz
bytetunes-ff3a4e3ee0c27c38ca9a63a4fe6fe54221687e91.zip
restructure notes
Diffstat (limited to 'NOTES')
-rw-r--r--NOTES49
1 files changed, 49 insertions, 0 deletions
diff --git a/NOTES b/NOTES
new file mode 100644
index 0000000..f49dfe5
--- /dev/null
+++ b/NOTES
@@ -0,0 +1,49 @@
+
+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