module Nudge # The Interpreter class executes the Push3 language loop: # 1. Pop the top item off the :exec Stack # 2. If it is a(n)... # * ... Instruction, execute its go() method; # * ... Literal or Sample, push its value to the Stack it names; # * ... Reference (Variable or Name), ... # * ... if it's bound to a value, push the bound value onto the :exec Stack; # * ... if it's not bound, push the name itself onto the :name Stack; # * ... CodeBlock, push its #contents (in the same order) back onto the :exec Stack class Interpreter attr_accessor :parser, :stepLimit, :steps attr_accessor :stacks, :instructions_library, :variables, :names, :types attr_accessor :last_name, :evaluate_channels # A program to be interpreted can be passed in as an optional parameter def initialize(params = {}) initialProgram = params[:program] || "" @types = params[:types] || NudgeType.all_types @stepLimit = params[:step_limit] || 3000 instructions = params[:instructions] || [] @instructions_library = Hash.new instructions.each {|i| self.enable(i)} # private parts @parser = NudgeLanguageParser.new() @names = Hash.new @variables = Hash.new @steps = 0 @last_name = "refAAAAA" @evaluate_channels = true @stacks = Hash.new {|hash, key| hash[key] = Stack.new(key) } # set it all up here self.reset(initialProgram) end # Resets the Interpreter state: # * clears all the Stacks (including the :exec Stack) # * loads a new program, # * parses the program # * if it parses, pushes it onto the :exec Stack # * (and if it doesn't parse, leaves all stacks empty) # * resets the @step counter. def reset(program="") self.clear_stacks @steps = 0 parsed = @parser.parse(program) newCode = parsed.to_points if parsed @stacks[:exec].push(newCode) @evaluate_channels = true end def clear_stacks @stacks = Hash.new {|hash, key| hash[key] = Stack.new(key) } end # Checks to see if either stopping condition applies: # 1. Is the :exec stack empty? # 2. Are the number of steps greater than self.stepLimit? def notDone? @stacks[:exec].depth > 0 && @steps < @stepLimit end # Execute one cycle of the Push3 interpreter rule: # 1. check termination conditions with self.notDone()? # 2. pop one item from :exec # 3. call its go() method # 4. increment the step counter self#steps def step if notDone? nextPoint = @stacks[:exec].pop nextPoint.go(self) @steps += 1 end end def instructions @instructions_library.keys end # invoke self.step() until a termination condition is true def run while notDone? self.step end end def lookup(name) @variables[name] || @names[name] end def references @names.merge(@variables).keys end def enable(item) if item.superclass == Instruction @instructions_library[item] = item.new(self) elsif item.include? NudgeType @types |= [item] end end def active?(item) puts "#{item.inspect} is the item" if item.superclass == Instruction @instructions_library.include?(item) elsif item.include? NudgeType puts "#{@types} is the type list" @types.include?(item) end end def bind_variable(name, value) raise(ArgumentError, "Variables can only be bound to Literals") unless value.kind_of?(LiteralPoint) @variables[name] = value end def bind_name(name, value) raise(ArgumentError, "Names can only be bound to Literals") unless value.kind_of?(LiteralPoint) @names[name] = value end def next_name @last_name = @last_name.next end def unbind_variable(name) @variables.delete(name) end def unbind_name(name) @names.delete(name) end def reset_variables @variables = Hash.new end def reset_names @names = Hash.new end def enable_all_instructions Instruction.all_instructions.each do |i| @instructions_library[i] = i.new(self) end end def enable_all_types @types = NudgeType.all_types end def disable(item) if item.superclass == Instruction @instructions_library.delete(item) elsif item.include? NudgeType @types.delete(item) end end def disable_all_instructions @instructions_library = Hash.new end def disable_all_types @types = [] end end end