lconvert.cpp

#include "lconvert.h"


struct stRegHelper {
	const TCHAR*	cn;
	const TCHAR*	en;
};


const stRegHelper key_words[] = {
	{ T("如果"), T("if") },
	{ T("那么"), T("then") },
	{ T("结束"), T("end") },
	{ T("否则"), T("else") },
	{ T("否则如果"), T("elseif") },
	{ T("又如"), T("elseif") },
	{ T("循环"), T("while") },
	{ T("局部变量"), T("local") },
	{ T("返回"), T("return") },
	{ T("空"), T("nil") },
	{ T("真"), T("true") },
	{ T("假"), T("false") },
	{ T("不"), T("not") },
	{ T("没有"), T("not") },
	{ T("没"), T("not") },
	{ T("执行"), T("do") },
	{ T("且"), T("and") },
	{ T("或"), T("or") },
	{ T("函数"), T("function") },
	{ T("局部函数"), T("local function") },
	{ T("重复"), T("repeat") },
	{ T("直到"), T("until") },
	{ T("跳出"), T("break") },
	{ T("对于"), T("for") },
	{ T("在"), T("in") },
	{ T("__索引"),T("__index")},
	{ T("__新索引"),T("__newindex") },
	{ T("__加"),T("__add") },
	{ T("__减"),T("__sub") },
	{ T("__乘"),T("__mul") },
	{ T("__除"),T("__div") },
	{ T("__取余"),T("__mod") },
	{ T("__指数"),T("__pow") },
	{ T("__负数"),T("__unm") },
	{ T("__连接"),T("__concat") },
	{ T("__长度"),T("__len") },
	{ T("__等于"),T("__eq") },
	{ T("__小于"),T("__lt") },
	{ T("__小于等于"),T("__le") },
	{ T("__调用"),T("__call") },
	{ T("__回收"),T("__gc") },
	{ T("__模式"),T("__mode") },
	{ T("__转字符串"),T("__tostring ") },
	{ NULL,NULL }
};

int TextCharToUtf8(char* buf, int buf_size, unsigned int c)
{
	if (c < 0x80)
	{
		buf[0] = (char)c;
		return 1;
	}
	if (c < 0x800)
	{
		if (buf_size < 2) return 0;
		buf[0] = (char)(0xc0 + (c >> 6));
		buf[1] = (char)(0x80 + (c & 0x3f));
		return 2;
	}
	if (c >= 0xdc00 && c < 0xe000)
	{
		return 0;
	}
	if (c >= 0xd800 && c < 0xdc00)
	{
		if (buf_size < 4) return 0;
		buf[0] = (char)(0xf0 + (c >> 18));
		buf[1] = (char)(0x80 + ((c >> 12) & 0x3f));
		buf[2] = (char)(0x80 + ((c >> 6) & 0x3f));
		buf[3] = (char)(0x80 + ((c) & 0x3f));
		return 4;
	}
	//else if (c < 0x10000)
	{
		if (buf_size < 3) return 0;
		buf[0] = (char)(0xe0 + (c >> 12));
		buf[1] = (char)(0x80 + ((c >> 6) & 0x3f));
		buf[2] = (char)(0x80 + ((c) & 0x3f));
		return 3;
	}
}

int TextStrToUtf8(char* buf, int buf_size, const wchar_t* in_text, const wchar_t* in_text_end)
{
	char* buf_out = buf;
	const char* buf_end = buf + buf_size;
	while (buf_out < buf_end - 1 && (!in_text_end || in_text < in_text_end) && *in_text)
	{
		unsigned int c = (unsigned int)(*in_text++);
		if (c < 0x80)
			*buf_out++ = (char)c;
		else
			buf_out += TextCharToUtf8(buf_out, (int)(buf_end - buf_out - 1), c);
	}
	*buf_out = 0;
	return (int)(buf_out - buf);
}

LConvert::LConvert()
{
	const stRegHelper* keywords = key_words;
	while (keywords->cn)
	{
		std::string key,value;
#ifdef UNICODE
		char buf[64];
		TextStrToUtf8(buf,sizeof(buf), keywords->cn,NULL);
		key = buf;
		TextStrToUtf8(buf, sizeof(buf), keywords->en, NULL);
		value = buf;
#else
		key = keywords->cn;
		value = keywords->en;
#endif
		m_keyWords[key] = value;
		++keywords;
	}
}


LConvert::~LConvert()
{


}

bool LConvert::Convert(const char* in, std::string& out)
{
	const char* ptr = in;
	std::string keyWord;
	if (!in)
		return false;

	while (*ptr)
	{
		switch (*ptr)
		{
			case '\n':
			case '\r':
			case '\t':
			case ' ':
			case '(':
			case ')':
			case ';':
			case ',':
			case '=':
			case '{':
			case '}':
			{
				if (!keyWord.empty())
				{
					map_t::iterator find = m_keyWords.find(keyWord);
					if (find != m_keyWords.end())
					{
						out.append(find->second);
					}
					else
						out.append(keyWord);

					keyWord.clear();
				}
				out.push_back(*ptr);
				break;
			}
			default:
			{
				bool writeToBuf = false;
				switch (*ptr)
				{
				case '\'':
				{
					keyWord.push_back(*ptr);
					++ptr;

					//找到单引号结束
					while (*ptr && *ptr != '\'')
					{
						if (*ptr == '\\' && ptr[1] == '\'')
						{
							// \'
							keyWord.push_back(*ptr);
							++ptr;
						}
						keyWord.push_back(*ptr);
						++ptr;
					}
					writeToBuf = true;
					break;
				}

				case '\"':
				{
					keyWord.push_back(*ptr);
					++ptr;

					//找到双引号结束
					while (*ptr && *ptr != '\"')
					{
						if (*ptr == '\\' && ptr[1] == '\"')
						{
							// \"
							keyWord.push_back(*ptr);
							++ptr;
						}
						keyWord.push_back(*ptr);
						++ptr;
					}
					writeToBuf = true;
					break;
				}
				case '[':
				{
					if (ptr[1]=='[')
					{
						//[[]]
						keyWord.push_back(*ptr);++ptr;
						keyWord.push_back(*ptr);++ptr;

						//
						while (*ptr)
						{
							if (*ptr == ']' && ptr[1] == ']')
							{
								// \"
								keyWord.push_back(*ptr);++ptr;
								break;
							}
							keyWord.push_back(*ptr);
							++ptr;
						}

					}
					else if (ptr[1] == '=' && ptr[2] == '=' && ptr[3] == '[')
					{
						//[==[]==]
						keyWord.push_back(*ptr); ++ptr;
						keyWord.push_back(*ptr); ++ptr;
						keyWord.push_back(*ptr); ++ptr;
						keyWord.push_back(*ptr); ++ptr;

						while (*ptr)
						{
							if (*ptr == ']' && ptr[1] == '=' && ptr[2] == '=' && ptr[3] == ']')
							{
								keyWord.push_back(*ptr);++ptr;
								keyWord.push_back(*ptr); ++ptr;
								keyWord.push_back(*ptr); ++ptr;
								break;
							}
							keyWord.push_back(*ptr);
							++ptr;
						}
					}
					writeToBuf = true;
					break;
				}
				default:
					break;
				}

				keyWord.push_back(*ptr);
				if (writeToBuf)
				{
					out.append(keyWord);
					keyWord.clear();
				}
			}
		}
		++ptr;
	}

	if (!keyWord.empty())
	{
		map_t::iterator find = m_keyWords.find(keyWord);
		if (find != m_keyWords.end())
		{
			out.append(find->second);
		}
		else
			out.append(keyWord);
	}

	return true;
}