Comments
Loading Dream Comments...
You must be logged in to write a comment - Log In
ArtistA beautiful purple-haired woman wearing a long purple velvet ankle-length dress with flouncy sleeves and purple suede high heels. She is painting a picture of a beautiful purple-haired woman wearing a long purple velvet ankle-length dress with flouncy sleeves and purple suede high heels.
The ::SHE+ILA:: compiler chiefly consists of a FSM and a few utility routines (ttyin, ttyout, hexout, etc). The FSM is implemented as a block of forty or so DW statements of the form :
LABEL: DW INPUT, CHAR, ACTION, BR0, BR1, ...., BRn
where BRn are a number of branches referencing the next states when the input routine INPUT returns a value 0, 1, ...., n. CHAR is the character signifying this state.
The FSM is extensible to implement a small LLM by adding extra fields to the DW statement (Markov weightings). These are preset to zero, and established by the presentation of training text. Potentially ::SHE+ILA:: could even be trained to compile other languages, such as C++, Pascal, Algol68, Fortran, or Cobol, though I haven't yet tried this :) It can certainly compile itself, though it is currently still implemented in 80x86 ASM for efficiency reasons.
Each time a state is entered, first its INPUT routine is called, then the exit branch is evaluated according to the return result of INPUT, and then the ACTION routine is called, and finally the next state is entered through the appropriate BR0 ... BRn label.
