Click here to Skip to main content
15,896,111 members
Articles / Programming Languages / C#

Lua Interpreter

Rate me:
Please Sign up or sign in to vote.
4.89/5 (32 votes)
22 Sep 2012MIT4 min read 99.6K   3K   85  
A Lua interpreter is implemented in C#. It allows to write Lua extensions in C# and call the extensions in Lua code.
using System;
using System.Collections.Generic;
using System.Text;

namespace Language.Lua
{
    public enum Associativity
    {
        NonAssociative,
        LeftAssociative,
        RightAssociative
    }

    public class OperTable
    {
        static Dictionary<string, int> precedence = new Dictionary<string, int>();
        static Associativity[] associativity;

        static OperTable()
        {
            List<string[]> operators = new List<string[]>();
            operators.Add(new string[] { "or" });
            operators.Add(new string[] { "and" });
            operators.Add(new string[] { "==", "~=" });
            operators.Add(new string[] { ">", ">=", "<", "<=" });
            operators.Add(new string[] { ".." });
            operators.Add(new string[] { "+", "-" });
            operators.Add(new string[] { "*", "/", "%" });
            operators.Add(new string[] { "#", "not" });
            operators.Add(new string[] { "^" });

            for (int index = 0; index < operators.Count; index++)
            {
                foreach (string oper in operators[index])
                {
                    precedence.Add(oper, index);
                }
            }

            associativity = new Associativity[operators.Count];
            associativity[0] = Associativity.LeftAssociative;
            associativity[1] = Associativity.LeftAssociative;
            associativity[2] = Associativity.NonAssociative;
            associativity[3] = Associativity.LeftAssociative;
            associativity[4] = Associativity.LeftAssociative;
            associativity[5] = Associativity.LeftAssociative;
            associativity[6] = Associativity.LeftAssociative;
            associativity[7] = Associativity.NonAssociative;
            associativity[8] = Associativity.RightAssociative;
        }

        /// <summary>
        /// Whether the input text is an operator or not
        /// </summary>
        /// <param name="oper"></param>
        /// <returns></returns>
        public static bool Contains(string oper)
        {
            return precedence.ContainsKey(oper);
        }

        /// <summary>
        /// whether operLeft has higher precedence than operRight
        /// </summary>
        /// <param name="operLeft"></param>
        /// <param name="operRight"></param>
        /// <returns></returns>
        public static bool IsPrior(string operLeft, string operRight)
        {
            if (operLeft == null) return false;
            if (operRight == null) return true;

            int priLeft = precedence[operLeft];
            int priRight = precedence[operRight];
            if (priLeft > priRight)
            {
                return true;
            }
            else if (priLeft < priRight)
            {
                return false;
            }
            else
            {
                switch (associativity[priLeft])
                {
                    case Associativity.LeftAssociative:
                        return true;
                    case Associativity.RightAssociative:
                        return false;
                    default:
                        return true;
                }
            }
        }
    }
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The MIT License


Written By
Architect YunCheDa Hangzhou
China China
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions