#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <unordered_map>
#include <stack>
#include <functional>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

inline bool isword(char c){return isalpha(c)||c=='_'||c=='@'||c=='$';}
inline bool isextword(char c){return isword(c)||isdigit(c);}
inline bool isoperator(char c){return (bool)strchr("+-*/=><!%^?{}",c);}

vector<string> tokenise(istream &stream){
	vector<string> tokens;
	string token;
	char c,stringmode;
	while(true){
		c=stream.get();
		if(!stream)break;
		if(isword(c)||(token.size()>0&&isextword(c))){
			token+=c;
		} else if(isdigit(c)){
			if(token.size()==0)token="#";
			token+=c;
		} else {
			if(token.size())tokens.push_back(move(token));
			if(isoperator(c))tokens.push_back(string(1,c));
			else if(c=='"'||c=='\''){
				stringmode=c;
				while(true){
					c=stream.get();
					if(!stream)throw string("Non-terminated string at end of file");
					if(c==stringmode){
						token="'"+token;
						tokens.push_back(move(token));
						break;
					}
					if(c=='\\'){
						c=stream.get();
						if(!stream)throw string("Non-terminated escape sequence in string at end of file");
						switch(c){
							case 'n':c='\n';break;
							case 'r':c='\r';break;
							case 't':c='\t';break;
							case '0':c='\0';break;
							case 'x':{
								int res;
								c=stream.get();
								if(!stream)throw string("Non-terminated hexadecimal escape sequence in string at end of file");
								res=c>='0'&&c<='9'?c-'0':(c>='a'&&c<='f')||(c>='A'&&c<='F')?(c&~32)-'A'+10:-1;
								if(res==-1)throw "Invalid character '"+string(1,c)+"'' in hexadecimal escape sequence in string";
								res*=16;
								c=stream.get();
								if(!stream)throw string("Non-terminated hexadecimal escape sequence in string at end of file");
								res+=c>='0'&&c<='9'?c-'0':(c>='a'&&c<='f')||(c>='A'&&c<='F')?(c&~32)-'A'+10:-241;
								if(res<0)throw "Invalid character '"+string(1,c)+"'' in hexadecimal escape sequence in string";
								c=(char)res;
								break;
							}
						}
					}
					token+=c;
				}
			} else if(isspace(c));
			else throw string("Invalid character found in source: '")+c+'\'';
		}
	}
	return tokens;
}

string readfile(ifstream stream){
	stream.seekg(0,ios::end);
	size_t len=stream.tellg();
	stream.seekg(0,ios::beg);
	string contents;
	contents.resize(len);
	stream.read(&*contents.begin(),len);
	return contents;
}

struct Stackitem{
	bool isstr;
	string strval;
	int intval;

	Stackitem(void):isstr(false),intval(0){}
	Stackitem(int _i):isstr(false),intval(_i){}
	Stackitem(const string &_s):isstr(true),strval(_s),intval(0){}
	operator bool(void){return (isstr&&strval.size())||(!isstr&&intval);}
	bool operator==(const Stackitem &other){return isstr==other.isstr&&(isstr?strval==other.strval:intval==other.intval);}
};

const unordered_map<string,function<void(stack<Stackitem>&,unordered_map<string,Stackitem>&)>> builtins={
	{"+",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '+' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(!a.isstr&&!b.isstr){
			S.emplace(a.intval+b.intval);
			return;
		}
		if(!a.isstr){
			a.strval=to_string(a.intval);
			a.isstr=true;
		}
		if(!b.isstr){
			b.strval=to_string(b.intval);
			b.isstr=true;
		}
		S.emplace(a.strval+b.strval);
	}},
	{"-",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '-' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr||b.isstr)throw string("Builtin '-' cannot accept a string argument");
		S.emplace(a.intval-b.intval);
	}},
	{"*",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '*' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr||b.isstr)throw string("Builtin '*' cannot accept a string argument");
		S.emplace(a.intval*b.intval);
	}},
	{"/",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '/' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr||b.isstr)throw string("Builtin '/' cannot accept a string argument");
		S.emplace(a.intval/b.intval);
	}},
	{"%",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '%' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr||b.isstr)throw string("Builtin '%' cannot accept a string argument");
		S.emplace(a.intval%b.intval);
	}},
	{"^",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '^' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr||b.isstr)throw string("Builtin '^' cannot accept a string argument");
		S.emplace((int)pow(a.intval,b.intval));
	}},
	{"!",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<1)throw string("Builtin '!' needs 1 stack item");
		Stackitem v;
		v=S.top(); S.pop();
		if(v.isstr)S.emplace(!v.strval.size());
		else S.emplace(!v.intval);
	}},
	{"=",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '=' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		S.emplace(a==b);
	}},
	{"<",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '<' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr&&b.isstr)S.emplace(a.strval<b.strval);
		else if(!a.isstr&&!b.isstr)S.emplace(a.intval<b.intval);
		else if(a.isstr)S.emplace(a.strval<to_string(b.intval));
		else S.emplace(to_string(a.intval)<b.strval);
	}},
	{">",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<2)throw string("Builtin '>' needs 2 stack items");
		Stackitem a,b;
		b=S.top(); S.pop();
		a=S.top(); S.pop();
		if(a.isstr&&b.isstr)S.emplace(a.strval>b.strval);
		else if(!a.isstr&&!b.isstr)S.emplace(a.intval>b.intval);
		else if(a.isstr)S.emplace(a.strval>to_string(b.intval));
		else S.emplace(to_string(a.intval)>b.strval);
	}},
	{"print",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<1)throw string("Builtin 'print' needs 1 stack item");
		Stackitem v;
		v=S.top(); S.pop();
		if(v.isstr)cout<<v.strval<<flush;
		else cout<<v.intval<<flush;
	}},
	{"lf",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		cout<<endl;
	}},
	{"dup",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<1)throw string("Builtin 'dup' needs 1 stack item");
		S.push(S.top());
	}},
	{"pop",[](stack<Stackitem> &S,unordered_map<string,Stackitem> &variables){
		if(S.size()<1)throw string("Builtin 'pop' needs 1 stack item");
		S.pop();
	}},
};

void runpasseval(const vector<string> &T,
              stack<Stackitem> &S,
              const unordered_map<string,vector<string>> &functions,
              unordered_map<string,Stackitem> &variables,
              const unordered_map<unsigned int,unsigned int> &jumpmap){
	unsigned int cursor;
	for(cursor=0;cursor<T.size();cursor++){
		const string &word=T[cursor];
		//cerr<<"Executing word <"<<word<<'>'<<endl;
		if(word[0]=='#'){
			S.emplace((int)strtol(word.data()+1,NULL,10));
		} else if(word[0]=='\''){
			S.push(word.substr(1));
		} else {
			auto it=variables.find(word);
			if(it!=variables.end()){
				S.push(it->second);
			} else {
				auto it=functions.find(word);
				if(it!=functions.end()){
					runpasseval(it->second,S,functions,variables,jumpmap);
				} else {
					if(word=="while"){
						if(S.size()<1)throw string("Keyword 'while' needs 1 stack item");
						Stackitem v=S.top(); S.pop();
						if(!v){
							cursor=jumpmap.find(cursor)->second-1; //jump to corresponding end
						}
						continue;
					} else if(word=="if"){
						if(S.size()<1)throw string("Keyword 'if' needs 1 stack item");
						Stackitem v=S.top(); S.pop();
						if(!v){
							cursor=jumpmap.find(cursor)->second-1; //jump to corresponding else/end
						}
						continue;
					} else if(word=="else"||word=="end"){
						cursor=jumpmap.find(cursor)->second-1;
						continue;
					}

					auto it=builtins.find(word);
					if(it==builtins.end())throw "Unknown variable or function '"+word+"'";
					it->second(S,variables);
				}
			}
		}
	}
}

void run(vector<string> T){
	unordered_map<string,vector<string>> functions;
	unordered_map<string,Stackitem> variables;
	unordered_map<unsigned int,unsigned int> jumpmap;
	stack<Stackitem> S;
	unsigned int cursor=0;
	//first pass, handle functions and includes
	while(cursor<T.size()){
		const string &word=T[cursor];
		if(word=="@defun"){
			if(cursor+3>=T.size())throw string("Unterminated @defun statement at end of file");
			string name=T[cursor+1];
			if(name[0]!='\'')throw string("@defun expected a string as name, but got '")+name+"'";
			name.erase(0,1);
			if(T[cursor+2]!="{")throw string("Invalid @defun statement of function ")+name;
			unsigned int start=cursor+3;
			unsigned int end;
			for(end=start;end<T.size()&&T[end]!="}";end++);
			vector<string> &functoks=functions[name];
			functoks.resize(end-start);
			for(unsigned int i=start;i<end;i++)functoks[i-start]=move(T[i]);
			T.erase(T.begin()+cursor,T.begin()+end+1);
		} else if(word=="@include"){
			if(cursor+1>=T.size())throw string("Unterminated @include statement at end of file");
			string name=T[cursor+1];
			if(name[0]!='\'')throw string("@include expected a string as file, but got '")+name+"'";
			name.erase(0,1);
			ifstream file(name);
			if(!file)throw string("Could not open file '")+name+"' specified by @include statement";
			vector<string> included=tokenise(file);
			file.close();
			T.erase(T.begin()+cursor,T.begin()+cursor+2);
			T.insert(T.begin()+cursor,included.begin(),included.end());
		} else {
			cursor++;
		}
	}

	//second pass, index flow control keywords and translate '?'
	vector<unsigned int> flowindexes;
	for(cursor=0;cursor<T.size();cursor++){
		const string &word=T[cursor];
		if(word=="?")T[cursor]="if";
		if(word=="end"||word=="while"||word=="if"||word=="else")flowindexes.push_back(cursor);
	}

	//third pass (over flowindexes), index jump targets in jumpmap
	for(unsigned int i=0;i<flowindexes.size();i++){
		const string &word=T[flowindexes[i]];
		if(word=="while"){
			if(i==flowindexes.size()-1)throw string("No 'end' after 'while' in source");
			int depth=1;
			unsigned int end;
			for(end=i+1;end<flowindexes.size();end++){
				if(T[flowindexes[end]]=="end")depth--;
				else if(T[flowindexes[end]]=="while"||T[flowindexes[end]]=="if")depth++;
				if(depth==0)break;
			}
			if(end==flowindexes.size())throw string("No 'end' after 'while' in source");
			jumpmap[flowindexes[i]]=flowindexes[end]+1;
			jumpmap[flowindexes[end]]=flowindexes[i];
		} else if(word=="if"){
			if(i==flowindexes.size()-1)throw string("No 'end' after 'if' in source");
			int depth=1;
			unsigned int els,end;
			for(els=i+1;els<flowindexes.size();els++){
				if(depth==1&&T[flowindexes[els]]=="else")break;
				else if(T[flowindexes[els]]=="end")depth--;
				else if(T[flowindexes[els]]=="while"||T[flowindexes[els]]=="if")depth++;
				if(depth==0)break;
			}
			if(els==flowindexes.size())throw string("No 'else' after 'if' in source");
			if(depth!=0){ //we found an else
				for(end=els+1;end<flowindexes.size();end++){
					if(T[flowindexes[end]]=="end")depth--;
					else if(T[flowindexes[end]]=="while"||T[flowindexes[end]]=="if")depth++;
					if(depth==0)break;
				}
				if(end==flowindexes.size())throw string("No 'end' after 'if' in source");
				jumpmap[flowindexes[i]]=flowindexes[els]+1;
				jumpmap[flowindexes[els]]=flowindexes[end]+1;
				jumpmap[flowindexes[end]]=flowindexes[end]+1;
			} else { //we found an end in the first place
				jumpmap[flowindexes[i]]=flowindexes[els]+1;
				jumpmap[flowindexes[els]]=flowindexes[els]+1;
			}
		}
	}

	//fourth pass, evaluate code
	runpasseval(T,S,functions,variables,jumpmap);
}

int main(int argc,char **argv){
	if(argc!=2){
		cerr<<"Call this interpreter with the Postrun source file"<<endl;
		return 1;
	}
	ifstream srcf(argv[1]);
	if(!srcf){
		cerr<<"Could not open file '"<<argv[1]<<"'"<<endl;
		return 1;
	}
	//string source=readfile(srcf);
	try {
		const vector<string> tokens=tokenise(srcf);
		for(const string &tok : tokens)cerr<<'['<<tok<<"] "; cerr<<endl;
		run(tokens);
		srcf.close();
	} catch(string e){
		cerr<<"ERROR: "<<e<<endl;
		return 1;
	}
}