OSDN Git Service
sforman [Sun, 30 Jul 2023 23:34:56 +0000 (16:34 -0700)]
Minor edits.
sforman [Sun, 30 Jul 2023 23:16:51 +0000 (16:16 -0700)]
I think I have got it.
sforman [Sun, 30 Jul 2023 23:14:52 +0000 (16:14 -0700)]
egad
sforman [Sun, 30 Jul 2023 23:03:17 +0000 (16:03 -0700)]
weird symbols in table
sforman [Sun, 30 Jul 2023 23:01:09 +0000 (16:01 -0700)]
mdtableeeeee
sforman [Sun, 30 Jul 2023 22:54:07 +0000 (15:54 -0700)]
MD TABLE!?
sforman [Sun, 30 Jul 2023 22:51:29 +0000 (15:51 -0700)]
Sort out the and/or/... ops.
sforman [Sun, 30 Jul 2023 22:42:55 +0000 (15:42 -0700)]
Crude type checking.
I forget why I was doing "not not" so I made it a little more clear. In
practice this is regressive: The built-in "isnt_bool" function should
be in the dictionary? Or prohibit type checking and let the bugs flow?
Rely on inference to prevent bugs that would pass the non-checking
versions of the functions? Hmm...
sforman [Sun, 30 Jul 2023 22:41:58 +0000 (15:41 -0700)]
Name Boolean ops.
So they don't overshadow the defs for the short-circuiting combinators.
sforman [Sun, 30 Jul 2023 21:59:09 +0000 (14:59 -0700)]
Error type (not just a string.)
This is mostly for fun, but I bet it comes in handy, eh?
At the very least, it's a nice catalog of the possible errors that the
basic Joy system might encounter.
sforman [Sun, 30 Jul 2023 21:27:27 +0000 (14:27 -0700)]
type alias JoyFunction
sforman [Sun, 30 Jul 2023 14:47:26 +0000 (07:47 -0700)]
Format.
sforman [Sun, 30 Jul 2023 14:45:06 +0000 (07:45 -0700)]
inscribe, definitions.
sforman [Sun, 30 Jul 2023 00:10:45 +0000 (17:10 -0700)]
Initialize dict with defs.
Just sqr for now, but it shows that it works.
I would like to return Results from add_def but it makes using foldl
slightly tricky, not a lot, just slightly, and my brainpower is low at
the mo'.
sforman [Sat, 29 Jul 2023 19:35:47 +0000 (12:35 -0700)]
Look up words in the dictionary.
If they are not built-in, which means you can't "shadow" built-ins with
"inscribe", which may or may not turn out to be what we want?
sforman [Sat, 29 Jul 2023 19:30:22 +0000 (12:30 -0700)]
Thread the dictionary through the call stack.
sforman [Sat, 29 Jul 2023 19:11:43 +0000 (12:11 -0700)]
Empty string is not an unknown word.
sforman [Sat, 29 Jul 2023 19:09:08 +0000 (12:09 -0700)]
Gotta keep a Dict around.
sforman [Sat, 29 Jul 2023 18:37:07 +0000 (11:37 -0700)]
Logical ops.
sforman [Sat, 29 Jul 2023 18:32:22 +0000 (11:32 -0700)]
Left- and Right-shift.
sforman [Sat, 29 Jul 2023 18:07:50 +0000 (11:07 -0700)]
Comparison ops.
sforman [Sat, 29 Jul 2023 17:44:51 +0000 (10:44 -0700)]
loop
sforman [Sat, 29 Jul 2023 17:38:12 +0000 (10:38 -0700)]
branch
sforman [Sat, 29 Jul 2023 17:28:31 +0000 (10:28 -0700)]
dip
sforman [Sat, 29 Jul 2023 17:23:06 +0000 (10:23 -0700)]
i
sforman [Sat, 29 Jul 2023 17:19:39 +0000 (10:19 -0700)]
truthy
I have to check into this: the Python version has "bool" and no
"truthy".
sforman [Sat, 29 Jul 2023 17:09:40 +0000 (10:09 -0700)]
swap
sforman [Sat, 29 Jul 2023 17:00:16 +0000 (10:00 -0700)]
stack, swaack
sforman [Sat, 29 Jul 2023 16:55:28 +0000 (09:55 -0700)]
pop
sforman [Sat, 29 Jul 2023 16:53:00 +0000 (09:53 -0700)]
first, rest
sforman [Sat, 29 Jul 2023 16:22:26 +0000 (09:22 -0700)]
dup
sforman [Sat, 29 Jul 2023 16:17:27 +0000 (09:17 -0700)]
cons
sforman [Sat, 29 Jul 2023 16:06:14 +0000 (09:06 -0700)]
clear, concat
sforman [Sat, 29 Jul 2023 15:57:58 +0000 (08:57 -0700)]
Minor cleanup.
sforman [Sat, 29 Jul 2023 15:49:31 +0000 (08:49 -0700)]
Type alias JList
sforman [Sat, 29 Jul 2023 14:51:31 +0000 (07:51 -0700)]
Refactor pop_int.
I don't like passing the stack through isnt_int but that let's you chain
with andThen.
There's probably a clever or idiomatic way to not do that and couple the
stack to the result without passing it through the type checker function
but I don't know what it is right now, and this works.
sforman [Sat, 29 Jul 2023 14:32:56 +0000 (07:32 -0700)]
Binary Math Ops
sforman [Sat, 29 Jul 2023 14:19:08 +0000 (07:19 -0700)]
I don't think andThen helps here?
sforman [Sat, 29 Jul 2023 13:54:15 +0000 (06:54 -0700)]
I can add integers!
sforman [Sat, 29 Jul 2023 04:51:34 +0000 (21:51 -0700)]
Parsing working.
Modeled on the OCaml code.
sforman [Fri, 28 Jul 2023 22:04:35 +0000 (15:04 -0700)]
A start on Joy types.
sforman [Fri, 28 Jul 2023 21:18:12 +0000 (14:18 -0700)]
In Elm.
sforman [Thu, 27 Jul 2023 17:32:45 +0000 (10:32 -0700)]
Use Python as SHELL in Makefile.
It's a simple task, but I'm not up on my CLI tools, so I went with
Python instead of sh. The split command doesn't have '-p' switch on
Ubuntu. (I'm using Ubuntu on this laptop because it can correctly
configure the WiFi and the laptop has no ethernet port.)
sforman [Thu, 27 Jul 2023 16:55:26 +0000 (09:55 -0700)]
minor cleanup
sforman [Thu, 27 Jul 2023 16:55:02 +0000 (09:55 -0700)]
minor cleanup
sforman [Thu, 27 Jul 2023 16:19:12 +0000 (09:19 -0700)]
Rename joy_to_ast to parser.
sforman [Thu, 27 Jul 2023 15:55:43 +0000 (08:55 -0700)]
Working on the docs.
The nbconvert tool has different behaviour now, so the HTML versions of
the notebooks look different.
sforman [Thu, 27 Jul 2023 03:47:57 +0000 (20:47 -0700)]
Minor work on the new site.
I'm moving away from OSDN, there have been a few technical issues
recently.
sforman [Wed, 26 Jul 2023 23:34:03 +0000 (16:34 -0700)]
Bold.
sforman [Wed, 26 Jul 2023 23:32:30 +0000 (16:32 -0700)]
Minor edits.
sforman [Wed, 26 Jul 2023 05:01:55 +0000 (22:01 -0700)]
the BinInt zero vanished?
sforman [Wed, 26 Jul 2023 04:46:36 +0000 (21:46 -0700)]
Minor edits.
sforman [Wed, 26 Jul 2023 04:13:35 +0000 (21:13 -0700)]
Working on README, put defs in joy.py
I'm on an Ubuntu system right now and the split command doesn't have the
'-p' switch. :( I wasn't happy with that janky solution anyway.
sforman [Wed, 26 Jul 2023 03:03:11 +0000 (20:03 -0700)]
minor edits
sforman [Tue, 25 Jul 2023 17:04:45 +0000 (10:04 -0700)]
Minor edits.
sforman [Tue, 25 Jul 2023 15:51:27 +0000 (08:51 -0700)]
Messing around with GNU Prolog.
I have it broken up into three stages: a parser that reads a string from
stdin and emits (Prolog) AST to stdout; an interpreter of sorts that
reads AST from stdin, evaluates it, and then emits the AST of the stack
on stdout; and a printer that reads AST on stdin and prints Joy-ish code
to stdout.
I say Joy-ish because currently math is not evaluated and results of
math appear as expressions, not values.
This is because GNU Prolog doesn't have unbounded integers (it's numbers
are machine integers) so literals that are larger than the machine word
are converted into atoms! To keep things simple, I made all ints into
atoms, but then you can't evaluate them: '1'+'2' is not '3' (it might be
'12' though.)
So I print them out at expressions:
$ echo "1 2 3 4 [+ sub /] i" | ./joy_to_ast | ./thun | ./printer
(1 div (2-(4+3)))
You could almost feed that to, say, Python to evaluate, eh? Or dc with
proper formatting? (man dc; "Desk Calculator".)
Anyway, it's a start. The Prolog interpreter is more for things like
type checking and inference, optimizing, compiling, etc. Symbolic stuff
that's a PITA to express in other languages. (The old type inference
code in Python was pages long, in Prolog it's just the thun/3 & thun/4
predicates themselves. At least so far. There are things we will want
to do eventually that might be a PITA to express in Prolog, eh?
sforman [Mon, 24 Jul 2023 18:29:39 +0000 (11:29 -0700)]
Compile on Ubuntu.
sforman [Mon, 24 Jul 2023 18:29:06 +0000 (11:29 -0700)]
Make it compatible with Xerblin.
sforman [Mon, 24 Jul 2023 18:28:45 +0000 (11:28 -0700)]
Minor edits.
Simon Forman [Wed, 22 Mar 2023 21:45:54 +0000 (14:45 -0700)]
Minor cleanup.
Simon Forman [Wed, 22 Mar 2023 18:54:17 +0000 (11:54 -0700)]
i combinator.
On a lark I implemented it in recursive style, but I'm not going to keep
it that way. I have to implement next_term() first and then I'll
uncomment i_joy_combinator().
Simon Forman [Wed, 22 Mar 2023 15:41:09 +0000 (08:41 -0700)]
concat
Simon Forman [Tue, 21 Mar 2023 19:34:28 +0000 (12:34 -0700)]
cons
Simon Forman [Tue, 21 Mar 2023 16:38:50 +0000 (09:38 -0700)]
minor cleanup
Simon Forman [Tue, 21 Mar 2023 16:33:20 +0000 (09:33 -0700)]
first
Simon Forman [Tue, 21 Mar 2023 16:27:00 +0000 (09:27 -0700)]
rest
Simon Forman [Tue, 21 Mar 2023 16:19:12 +0000 (09:19 -0700)]
rest CANNOT_TAKE_REST_OF_EMPTY_LIST
Simon Forman [Mon, 20 Mar 2023 23:33:11 +0000 (16:33 -0700)]
swap
Simon Forman [Sat, 18 Mar 2023 21:13:51 +0000 (14:13 -0700)]
Check for error after cons'ing term.
Simon Forman [Sat, 18 Mar 2023 19:48:59 +0000 (12:48 -0700)]
pop_any()
Simon Forman [Sat, 18 Mar 2023 19:43:30 +0000 (12:43 -0700)]
dup
Simon Forman [Sat, 18 Mar 2023 19:31:36 +0000 (12:31 -0700)]
stack function.
Simon Forman [Sat, 18 Mar 2023 18:50:18 +0000 (11:50 -0700)]
pop()
Simon Forman [Sat, 18 Mar 2023 18:41:16 +0000 (11:41 -0700)]
Move pop_list().
Simon Forman [Sat, 18 Mar 2023 18:40:19 +0000 (11:40 -0700)]
No reason to pass expression to function.
Simon Forman [Sat, 18 Mar 2023 18:31:38 +0000 (11:31 -0700)]
pop_list()
Kind of a misnomer, you have to take the tail() of the stack yourself.
This function only returns the list from TOS.
Simon Forman [Sat, 18 Mar 2023 18:31:12 +0000 (11:31 -0700)]
Minor cleanup.
Simon Forman [Sat, 18 Mar 2023 18:26:27 +0000 (11:26 -0700)]
Swaack and error macro.
Simon Forman [Sat, 18 Mar 2023 17:40:49 +0000 (10:40 -0700)]
Use clear, set up for swaack.
Simon Forman [Fri, 17 Mar 2023 19:10:18 +0000 (12:10 -0700)]
Clear.
Simon Forman [Fri, 10 Mar 2023 22:11:54 +0000 (14:11 -0800)]
Did i not commit this?
Simon Forman [Mon, 6 Mar 2023 07:20:37 +0000 (23:20 -0800)]
A start on the joy() interpeter.
Simon Forman [Mon, 6 Mar 2023 07:04:56 +0000 (23:04 -0800)]
Minor cleanup.
Simon Forman [Mon, 6 Mar 2023 03:37:15 +0000 (19:37 -0800)]
Catch unbalanced brackets.
Simon Forman [Mon, 6 Mar 2023 03:26:34 +0000 (19:26 -0800)]
Minor cleanup.
Simon Forman [Mon, 6 Mar 2023 02:46:05 +0000 (18:46 -0800)]
Only allocate strings once.
That for loop in hash_fragment() is the gnarliest I've ever written.
Simon Forman [Mon, 6 Mar 2023 01:01:25 +0000 (17:01 -0800)]
Combine tokenizer and parser.
I'm pretty happy with this. It's iterative rather than recursive so you
won't blow out the call stack if you want to parse a million brackets
(intermediate results are stored on (another) little stack.) It scans
the string and builds lists and sublists as it goes, without wasting
cons cells.
Simon Forman [Sun, 5 Mar 2023 23:20:22 +0000 (15:20 -0800)]
Thread error handling through tokenizer.
Simon Forman [Sun, 5 Mar 2023 22:36:55 +0000 (14:36 -0800)]
It turns out the error machinery was working...
So I was memset'ing the hash table and string table /after/ setting up
the left- and right-bracket tokens! So then when I tried to print the
token list and ht_lookup() dutifully set the error code when it couldn't
find the strings in the hash table, the system properly quit printing
and halted. D'oh! That was a subtle one. Obvious in hindsight.
Simon Forman [Sun, 5 Mar 2023 04:50:34 +0000 (20:50 -0800)]
Fold parser code into joy_types.c
Add some docs, minor cleanup.
Simon Forman [Sun, 5 Mar 2023 01:48:26 +0000 (17:48 -0800)]
It seems to be working.
It took all expletive-deleted day but I finally nailed it down. In the
end the last bug was I was decrementing a stack pointer /after/ trying
to load the item at the (empty) top of the stack. Classic.
I still need to make it not re-allocate strings that it has already
interned, but beyond that I think it's fine.
Simon Forman [Sun, 5 Mar 2023 01:23:54 +0000 (17:23 -0800)]
tokenate() and reverse_list_in_place()
Simon Forman [Sat, 4 Mar 2023 23:48:55 +0000 (15:48 -0800)]
Use symbols for tokens for brackets.
Try a different tack on the parser.
Simon Forman [Sat, 4 Mar 2023 19:59:19 +0000 (11:59 -0800)]
Almost working parser.
Simon Forman [Sat, 4 Mar 2023 16:31:40 +0000 (08:31 -0800)]
Minor cleanup.
Some printing to see the machinery in action.
Simon Forman [Sat, 4 Mar 2023 16:25:32 +0000 (08:25 -0800)]
Joy parser in NCC.
Simon Forman [Sat, 4 Mar 2023 03:23:15 +0000 (19:23 -0800)]
A start on error handling.
Simon Forman [Fri, 3 Mar 2023 22:52:26 +0000 (14:52 -0800)]
Double hashing w/ extra bits of hash.
Simon Forman [Fri, 3 Mar 2023 20:05:40 +0000 (12:05 -0800)]
A start on a hash table for symbols.
Simon Forman [Fri, 3 Mar 2023 15:31:52 +0000 (07:31 -0800)]
Joy in UVM NCC code.