Thursday, November 17, 2011

Stuck!

I need an ontology view for my G machine soon.  Don't have one, looking for one.;
Solution!!


I am going to create the space/newline ontology display system for command lines! A descent is a space, a set element is a (*.space.newline) in Typeface Explosion  Basically, for ten lines of code I get a preliminary version of the TE byte code interpreter.That should take all of ten lines of code, and it gets me a standard command line interface to the engine.

User's manual for the G engine:
The user types in a string matching the rules of TE, namesly:
All keywords are character alpha characters or numbers, distinctly  All operators are highly unusual looking punctuation marks, namely the . amd , operators for now.   Given the built in operators, the user will be simply typing in G graphs in descending order.  The enhanced user interface converts  these to triple and runs them throogg the machine, after configuration.. The results displayed with standard tabs and new lines to preserve nested order.

I am up to 250 lines, but I get lotta leverage  the sqlite3 system.
The TE lexical analysis tool is done! A complex bit of machinery. It takes every alphanumerical you type at it to be the next char in a triple key. As soon at it finds a particularly ugly punctuation mark, it calls that the link. It then jumps into the triple machine.

G does the rest. G generates stuff in the same form you enter it. G only knows nested ontologies. So wen some mysterious SQL procedure des a select key,link,pointer, without any insert, then G prints that out on TE syntax. Theoretically two G machines could converse.
Here it is. The idea mainly is to accept input until something looks looke an operator, then try it out.
TRIPLE t;
do {
t.link = getchar();
if(!isalnum(t.link)) {
key[i] = 0;
t.pointer=0;
triple();
}
} while((key[i-1] != '\n') );

No comments: