"Soros interpreter (see http://numbertext.org)"
import re

def run(program, data):
    return compile(program).run(data)

def compile(program):
    return _Soros(program)

# conversion function
def _tr(text, chars, chars2, delim):
    for i in range(0, len(chars)):
	text = text.replace(delim + chars[i], chars2[i])
    return text

# string literals for metacharacter encoding
_m = "\\\";#$()|"
_c = u"\uE000\uE001\uE002\uE003\uE004\uE005\uE006\uE007" # Unicode private area
_pipe = u"\uE003"

# pattern to recognize function calls in the replacement string
_func = re.compile(_tr(r"""(?:\|?(?:\$\()+)?  # optional nested calls
		(\|?\$\(([^\(\)]*)\)\|?)      # inner call (2 subgroups)
		(?:\)+\|?)?""", 	      # optional nested calls
		_m[4:], _c[:4], "\\"), re.X)  # \$, \(, \), \| -> \uE000..\uE003

class _Soros:
    def __init__(self, prg):
	self.lines = []
	self.numbertext = False
	if prg.find("__numbertext__") > -1:
	    self.numbertext = True
	    prg = "0+(0|[1-9]\\d*) $1\n" + prg.replace("__numbertext__", "")
	prg = _tr(prg, _m[:4], _c[:4], "\\") # \\, \", \;, \# -> \uE000..\uE003
	for s in re.sub("(#[^\n]*)?(\n|$)", ";", prg).split(";"):
	    m = re.match("^\s*(\"[^\"]*\"|[^\s]*)\s*(.*[^\s])?\s*$", s)
	    if m != None:
		s = _tr(m.group(1).strip("\""), _c[1:4], _m[1:4], "") \
		    .replace(_c[_m.find("\\")], "\\\\") # -> \\, ", ;, #
		if m.group(2) != None:
		    s2 = m.group(2).strip("\"")
		else:
		    s2 = ""
		s2 = _tr(s2, _m[4:], _c[4:], "\\") # \$, \(, \), \| -> \uE004..\uE007
		s2 = re.sub(r"(\$\d|\))\|\$", r"\1||$", s2) # $()|$() -> $()||$()
		s2 = _tr(s2, _c[:4], _m[:4], "")   # \uE000..\uE003-> \, ", ;, #
		s2 = _tr(s2, _m[4:], _c[:4], "")   # $, (, ), | -> \uE000..\uE003
		s2 = _tr(s2, _c[4:], _m[4:], "") # \uE004..\uE007 -> $, (, ), |
		s2 = re.sub(ur"\\(\d)", r"\\g<\1>",
		    re.sub(ur"\uE000(\d)", ur"\uE000\uE001\\g<\1>\uE002", s2))
		self.lines = self.lines + [[
		    re.compile("^" + s.lstrip("^").rstrip("$") + "$"),
		    s2, s[:1] == "^", s[-1:] == "$"]]

    def run(self, data):
	if self.numbertext:
	    return re.sub("  +", " ", self._run(data, True, True).strip())
	return self._run(data, True, True)

    def _run(self, data, begin, end):
	for i in self.lines:
	    if not ((begin == False and i[2]) or (end == False and i[3])):
		m = i[0].match(data)
		if m:
		    s = m.expand(i[1])
		    n = _func.search(s)
		    while n:
			b = False
			e = False
			if n.group(1)[0:1] == _pipe or n.group()[0:1] == _pipe:
			    b = True
			elif n.start() == 0:
			    b = begin
			if n.group(1)[-1:] == _pipe or n.group()[-1:] == _pipe:
			    e = True
			elif n.end() == len(s):
			    e = end
			s = s[:n.start(1)] + self._run(n.group(2), b, e) + s[n.end(1):]
			n = _func.search(s)
		    return s
	return ""