grammar::me::cpu(n) | Grammar operations and usage | grammar::me::cpu(n) |
grammar::me::cpu - Virtual machine implementation II for parsing token streams
package require Tcl 8.4
package require grammar::me::cpu ?0.2?
::grammar::me::cpu meName matchcode
meName option ?arg arg ...?
meName lc location
meName tok ?from ?to??
meName pc state
meName iseof state
meName at state
meName cc state
meName sv
meName ok
meName error
meName lstk state
meName astk state
meName mstk state
meName estk state
meName rstk state
meName nc state
meName ast
meName halted
meName code
meName eof
meName put tok lex line col
meName putstring string lvar cvar
meName run ?n?
meName pull nextcmd
meName reset
meName destroy
This package provides an implementation of the ME virtual machine. Please go and read the document grammar::me_intro first if you do not know what a ME virtual machine is.
This implementation provides an object-based API and the machines are not truly tied to Tcl. A C implementation of the same API is quite possible.
Internally the package actually uses the value-based machine manipulation commands as provided by the package grammar::me::cpu::core to perform its duties.
The package directly provides only a single command for the construction of ME virtual machines.
The argument matchcode contains the match instructions the machine has to execute while parsing the input stream. Please read section MATCH CODE REPRESENTATION of the documentation for the package grammar::me::cpu::core for the specification of the structure of this value.
The tokmap argument taken by the implementation provided by the package grammar::me::tcl is here hidden inside of the match instructions and therefore not needed.
All ME virtual machine objects created by the class command specified in section CLASS API support the methods listed below.
The machines provided by this package provide methods for operation in both push- and pull-styles. Push-style means that tokens are pushed into the machine state when they arrive, triggering further execution until they are consumed. In other words, this allows the machine to be suspended and resumed at will and an arbitrary number of times, the quasi-parallel operation of several machines, and the operation as part of the event loop.
Note that the command is not able to convert locations which have not been reached by the machine yet. In other words, if the machine has read 7 tokens the command is able to convert the offsets 0 to 6, but nothing beyond that. This also shows that it is not possible to convert offsets which refer to locations before the beginning of the stream.
Each element of the returned list is a list of four elements, the token, its associated lexeme, line number, and column index, in this order. This command places the same restrictions on its location arguments as the method lc.
If no limit n was set only the last two conditions are checked for.
The command prefix nextcmd represents the input stream of characters and is invoked by the machine whenever the a new character from the stream is required. The instruction for handling this is ict_advance. The callback has to return either the empty list, or a list of 4 elements containing the token, its lexeme attribute, and its location as line number and column index, in this order. The empty list is the signal that the end of the input stream has been reached. The lexeme attribute is stored in the terminal cache, but otherwise not used by the machine.
The end of the input stream for this method does not imply that method eof is called for the machine as a whole. By avoiding this and still asking for an explicit call of the method it is possible to mix push- and pull-style operation during the lifetime of the machine.
This document, and the package it describes, will undoubtedly contain bugs and other problems. Please report such in the category grammar_me of the Tcllib SF Trackers [http://sourceforge.net/tracker/?group_id=12883]. Please also report any ideas for enhancements you may have for either package and/or documentation.
grammar, parsing, virtual machine
Grammars and finite automata
Copyright (c) 2005-2006 Andreas Kupries <andreas_kupries@users.sourceforge.net>
0.2 | grammar_me |