#{Update v0.4.3} Gremlin Scheme (for GBC translation)

Hi,

There now is code for adding a variable or lambda to the symbol table after proving (with the Scheme theorem prover) that e.g. (define x 5) is a variable definition in Scheme itself. It gets proven more or less as in prolog with (define ?p ?q) parsing. Since prolog contains many patented circumstances I have to omit logic functions, I can only use rules and rule firing. Note that the symbol parsing does not yet fetch name and body/value of the define (this needs additional parsing.)

Also, I made another API for the theorem provers (there's a Scheme theorem prover on top of a common one.)

There now also is a table for the GBC (I'll start with a basic classic GB) wherein you can find "LD" and its opcode so you can dump it to file for e.g. translation to assembler or GB microcode (a ROM.)

Now I have to dump e.g. (define x 5) with load (LD) and store to the GBC system for translation, as said GBC assembler or its microcode.

The latest version ATM is 0.4.3 and is available at : sf.net/projects/gremlin-scheme/files/
  • Like
Reactions: zfreeman

Comments

There are no comments to display.

Blog entry information

Author
zarathewizard
Views
169
Last update

More entries in Personal Blogs

More entries from zarathewizard

General chit-chat
Help Users
    S @ salazarcosplay: how are you doing @K3Nv2