92 lines
2.2 KiB
Python
92 lines
2.2 KiB
Python
# -*- coding: utf-8 -*-
|
|
#
|
|
# Copyright © 2014, 2015 Simon Forman
|
|
#
|
|
# This file is part of joy.py
|
|
#
|
|
# joy.py is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# joy.py is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with joy.py. If not see <http://www.gnu.org/licenses/>.
|
|
#
|
|
from inspect import getdoc
|
|
|
|
from joy.joy import run
|
|
from joy.utils.stack import stack_to_string
|
|
|
|
|
|
def is_numerical(s):
|
|
try:
|
|
float(s)
|
|
except ValueError:
|
|
return False
|
|
return True
|
|
|
|
|
|
class World(object):
|
|
|
|
def __init__(self, stack=(), dictionary=None, text_widget=None):
|
|
self.stack = stack
|
|
self.dictionary = dictionary or {}
|
|
self.text_widget = text_widget
|
|
|
|
def do_lookup(self, name):
|
|
word = self.dictionary[name]
|
|
self.stack = word, self.stack
|
|
self.print_stack()
|
|
|
|
def do_opendoc(self, name):
|
|
if is_numerical(name):
|
|
print 'The number', name
|
|
else:
|
|
try:
|
|
word = self.dictionary[name]
|
|
except KeyError:
|
|
print repr(name), '???'
|
|
else:
|
|
print getdoc(word)
|
|
self.text_widget.see('end')
|
|
|
|
def pop(self):
|
|
if self.stack:
|
|
self.stack = self.stack[1]
|
|
self.print_stack()
|
|
|
|
def push(self, it):
|
|
it = it.encode('utf8')
|
|
self.stack = it, self.stack
|
|
self.print_stack()
|
|
|
|
def peek(self):
|
|
if self.stack:
|
|
return self.stack[0]
|
|
|
|
def interpret(self, command):
|
|
self.stack, _, self.dictionary = run(
|
|
command,
|
|
self.stack,
|
|
self.dictionary,
|
|
)
|
|
self.print_stack()
|
|
|
|
def has(self, name):
|
|
return self.dictionary.has_key(name)
|
|
|
|
def save(self):
|
|
pass
|
|
|
|
def print_stack(self):
|
|
stack_out_index = self.text_widget.search('<' 'STACK', 1.0)
|
|
if stack_out_index:
|
|
self.text_widget.see(stack_out_index)
|
|
s = stack_to_string(self.stack) + '\n'
|
|
self.text_widget.insert(stack_out_index, s)
|