Lua (programming language)
Lua ; from meaning moon is a lightweight, high-level, multi-paradigm programming language designed primarily for embedded use in applications. Lua is cross-platform, since the interpreter of compiled bytecode is written in ANSI C, and Lua has a relatively simple C API to embed it into applications.
Lua was originally designed in 1993 as a language for extending software applications to meet the increasing demand for customization at the time. It provided the basic facilities of most procedural programming languages, but more complicated or domain-specific features were not included; rather, it included mechanisms for extending the language, allowing programmers to implement such features. As Lua was intended to be a general embeddable extension language, the designers of Lua focused on improving its speed, portability, extensibility, and ease-of-use in development.
History
Lua was created in 1993 by Roberto Ierusalimschy, Luiz Henrique de Figueiredo, and Waldemar Celes, members of the Computer Graphics Technology Group Tecgraf at the Pontifical Catholic University of Rio de Janeiro, in Brazil.
From 1977 until 1992, Brazil had a policy of strong trade barriers called a market reserve for computer hardware and software. In that atmosphere, Tecgraf's clients could not afford, either politically or financially, to buy customized software from abroad. Those reasons led Tecgraf to implement the basic tools it needed from scratch.
Lua's predecessors were the data-description/configuration languages SOL Simple Object Language and DEL data-entry language. They had been independently developed at Tecgraf in 1992–1993 to add some flexibility into two different projects both were interactive graphical programs for engineering applications at Petrobras company. There was a lack of any flow-control structures in SOL and DEL, and Petrobras felt a growing need to add full programming power to them.
In The Evolution of Lua, the language's authors wrote:
In 1993, the only real contender was Tcl, which had been explicitly designed to be embedded into applications. However, Tcl had unfamiliar syntax, did not offer good support for data description, and ran only on Unix platforms. We did not consider LISP or Scheme because of their unfriendly syntax. Python was still in its infancy. In the free, do-it-yourself atmosphere that then reigned in Tecgraf, it was quite natural that we should try to develop our own scripting language ... Because many potential users of the language were not professional programmers, the language should avoid cryptic syntax and semantics. The implementation of the new language should be highly portable, because Tecgraf's clients had a very diverse collection of computer platforms. Finally, since we expected that other Tecgraf products would also need to embed a scripting language, the new language should follow the example of SOL and be provided as a library with a C API.
Lua 1.0 was designed in such a way that its object constructors, being then slightly different from the current light and flexible style, incorporated the data-description syntax of SOL hence the name Lua: Sol is also the Portuguese word for "Sun", Lua being the word for "Moon". Lua syntax for control structures was mostly borrowed from Modula if, while, repeat/until, but also had taken influence from CLU multiple assignments and multiple returns from function calls, as a simpler alternative to reference parameters or explicit pointers, C++ "neat idea of allowing a local variable to be declared only where we need it", SNOBOL and AWK associative arrays. In an article published in Dr. Dobb's Journal, Lua's creators also state that LISP and Scheme with their single, ubiquitous data-structure mechanism the list were a major influence on their decision to develop the table as the primary data structure of Lua.
Lua semantics have been increasingly influenced by Scheme over time, especially with the introduction of anonymous functions and full lexical scoping. Several features were added in new Lua versions.
Versions of Lua prior to version 5.0 were released under a license similar to the BSD license. From version 5.0 onwards, Lua has been licensed under the MIT License. Both are permissive free software licences and are almost identical.
Features
Lua is commonly described as a "multi-paradigm" language, providing a small set of general features that can be extended to fit different problem types. Lua does not contain explicit support for inheritance, but allows it to be implemented with metatables. Similarly, Lua allows programmers to implement namespaces, classes, and other related features using its single table implementation; first-class functions allow the employment of many techniques from functional programming; and full lexical scoping allows fine-grained information hiding to enforce the principle of least privilege.
In general, Lua strives to provide simple, flexible meta-features that can be extended as needed, rather than supply a feature-set specific to one programming paradigm. As a result, the base language is light—the full reference interpreter is only about 247 kB compiled—and easily adaptable to a broad range of applications.
Lua is a dynamically typed language intended for use as an extension or scripting language and is compact enough to fit on a variety of host platforms. It supports only a small number of atomic data structures such as boolean values, numbers double-precision floating point and 64-bit integers by default, and strings. Typical data structures such as arrays, sets, lists, and records can be represented using Lua's single native data structure, the table, which is essentially a heterogeneous associative array.
Lua implements a small set of advanced features such as first-class functions, garbage collection, closures, proper tail calls, coercion automatic conversion between string and number values at run time, coroutines cooperative multitasking and dynamic module loading.
The classic "Hello, World!" program can be written as follows:
print"Hello World!"
or as:
print 'Hello World!'
A comment in Lua starts with a double-hyphen and runs to the end of the line, similar to Ada, Eiffel, Haskell, SQL and VHDL. Multi-line strings and comments are adorned with double square brackets.
The factorial function is implemented as a function in this example:
function factorialn
local x = 1
for i = 2, n do
x = x * i
end
return x
end
Lua has four types of loops: the loop, the repeat loop similar to a loop, the numeric loop, and the generic for loop.
--condition = true while condition do --statements end repeat --statements until condition for i = first, last, delta do --delta may be negative, allowing the for loop to count down or up --statements --example: printi end
The generic for loop:
for key, value in pairs_G do printkey, value end
would iterate over the table _G using the standard iterator function pairs, until it returns nil.
You can also do a nested loop, which is a loop inside of another loop.
local grid = {
{ 11, 12, 13 },
{ 21, 22, 23 },
{ 31, 32, 33 }
}
for y, row in ipairsgrid do
for x, value in ipairsrow do
printx, y, grid[y][x]
end
end
Lua's treatment of functions as first-class values is shown in the following example, where the print function's behavior is modified:
do
local oldprint = print
-- Store current print function as oldprint
function prints
--[[ Redefine print function. The usual print function can still be used
through oldprint. The new one has only one argument.]]
oldprints == "foo" and "bar" or s
end
end
Any future calls to print will now be routed through the new function, and because of Lua's lexical scoping, the old print function will only be accessible by the new, modified print.
Lua also supports closures, as demonstrated below:
function addtox
-- Return a new function that adds x to the argument
return functiony
--[=[ When we refer to the variable x, which is outside the current
scope and whose lifetime would be shorter than that of this anonymous
function, Lua creates a closure.]=]
return x + y
end
end
fourplus = addto4
printfourplus3 -- Prints 7
--This can also be achieved by calling the function in the following way:
printaddto43
--[[ This is because we are calling the returned function from 'addto4' with the argument '3' directly.
This also helps to reduce data cost and up performance if being called iteratively.
]]
A new closure for the variable x is created every time addto is called, so that each new anonymous function returned will always access its own x parameter. The closure is managed by Lua's garbage collector, just like any other object.
Tables are the most important data structures and, by design, the only built-in composite data type in Lua and are the foundation of all user-created types. They are associative arrays with addition of automatic numeric key and special syntax.
A table is a collection of key and data pairs, where the data is referenced by key; in other words, it is a hashed heterogeneous associative array.
Tables are created using the {} constructor syntax.
a_table = {} -- Creates a new, empty table
Tables are always passed by reference see Call by sharing.
A key index can be any value except nil and NaN, including functions.
a_table = {x = 10} -- Creates a new table, with one entry mapping "x" to the number 10.
printa_table["x"] -- Prints the value associated with the string key, in this case 10.
b_table = a_table
b_table["x"] = 20 -- The value in the table has been changed to 20.
printb_table["x"] -- Prints 20.
printa_table["x"] -- Also prints 20, because a_table and b_table both refer to the same table.
A table is often used as structure or record by using strings as keys. Because such use is very common, Lua features a special syntax for accessing such fields.
point = { x = 10, y = 20 } -- Create new table
printpoint["x"] -- Prints 10
printpoint.x -- Has exactly the same meaning as line above. The easier-to-read dot notation is just syntactic sugar.
By using a table to store related functions, it can act as a namespace.
Point = {}
Point.new = functionx, y
return {x = x, y = y} -- return {["x"] = x, ["y"] = y}
end
Point.set_x = functionpoint, x
point.x = x -- point["x"] = x;
end
Tables are automatically assigned a numerical key, enabling them to be used as an array data type. The first automatic index is 1 rather than 0 as it is for many other programming languages though an explicit index of 0 is allowed.
A numeric key 1 is distinct from a string key "1".
array = { "a", "b", "c", "d" } -- Indices are assigned automatically.
printarray[2] -- Prints "b". Automatic indexing in Lua starts at 1.
print#array -- Prints 4. # is the length operator for tables and strings.
array[0] = "z" -- Zero is a legal index.
print#array -- Still prints 4, as Lua arrays are 1-based.
The length of a table t is defined to be any integer index n such that t[n] is not nil and t[n+1] is nil; moreover, if t[1] is nil, n can be zero. For a regular array, with non-nil values from 1 to a given n, its length is exactly that n, the index of its last value. If the array has "holes" that is, nil values between other non-nil values, then #t can be any of the indices that directly precedes a nil value that is, it may consider any such nil value as the end of the array.
ExampleTable =
{
{1, 2, 3, 4},
{5, 6, 7, 8}
}
printExampleTable[1][3] -- Prints "3"
printExampleTable[2][4] -- Prints "8"
A table can be an array of objects.
function Pointx, y -- "Point" object constructor
return { x = x, y = y } -- Creates and returns a new object table
end
array = { Point10, 20, Point30, 40, Point50, 60 } -- Creates array of points
-- array = { { x = 10, y = 20 }, { x = 30, y = 40 }, { x = 50, y = 60 } };
printarray[2].y -- Prints 40
Using a hash map to emulate an array normally is slower than using an actual array; however, Lua tables are optimized for use as arrays to help avoid this issue.
Extensible semantics is a key feature of Lua, and the metatable concept allows Lua's tables to be customized in powerful ways. The following example demonstrates an "infinite" table. For any n, fibs[n] will give the n-th Fibonacci number using dynamic programming and memoization.
fibs = { 1, 1 } -- Initial values for fibs[1] and fibs[2].
setmetatablefibs, {
__index = functionvalues, n --[[__index is a function predefined by Lua,
it is called if key "n" does not exist.]]
values[n] = values[n - 1] + values[n - 2] -- Calculate and memoize fibs[n].
return values[n]
end
}
Although Lua does not have a built-in concept of classes, object-oriented programming can be achieved using two language features: first-class functions and tables. By placing functions and related data into a table, an object is formed. Inheritance both single and multiple can be implemented using the metatable mechanism, telling the object to look up nonexistent methods and fields in parent objects.
There is no such concept as "class" with these techniques; rather, prototypes are used, similar to Self or JavaScript. New objects are created either with a factory method that constructs new objects from scratch or by cloning an existing object.
Lua provides some syntactic sugar to facilitate object orientation. To declare member functions inside a prototype table, one can use function table:funcargs, which is equivalent to function table.funcself, args. Calling class methods also makes use of the colon: object:funcargs is equivalent to object.funcobject, args.
Creating a basic vector object:
local Vector = {}
Vector.__index = Vector
function Vector:newx, y, z -- The constructor
return setmetatable{x = x, y = y, z = z}, Vector
end
function Vector:magnitude -- Another method
-- Reference the implicit object using self
return math.sqrtself.x^2 + self.y^2 + self.z^2
end
local vec = Vector:new0, 1, 0 -- Create a vector
printvec:magnitude -- Call a method output: 1
printvec.x -- Access a member variable output: 0
Implementation
Lua programs are not interpreted directly from the textual Lua file, but are compiled into bytecode, which is then run on the Lua virtual machine. The compilation process is typically invisible to the user and is performed during run-time, but it can be done offline in order to increase loading performance or reduce the memory footprint of the host environment by leaving out the compiler. Lua bytecode can also be produced and executed from within Lua, using the dump function from the string library and the load/loadstring/loadfile functions. Lua version 5.3.4 is implemented in approximately 24,000 lines of C code.
Like most CPUs, and unlike most virtual machines which are stack-based, the Lua VM is register-based, and therefore more closely resembles an actual hardware design. The register architecture both avoids excessive copying of values and reduces the total number of instructions per function. The virtual machine of Lua 5 is one of the first register-based pure VMs to have a wide use. Raku's Parrot and Android's Dalvik are two other well-known register-based VMs. PCScheme's VM was also register-based.
This example is the bytecode listing of the factorial function defined above as shown by the luac 5.1 compiler:
function <factorial.lua:1,7> 9 instructions, 36 bytes at 0x8063c60 1 param, 6 slots, 0 upvalues, 6 locals, 2 constants, 0 functions 1 [2] LOADK 1 -1 ; 1 2 [3] LOADK 2 -2 ; 2 3 [3] MOVE 3 0 4 [3] LOADK 4 -1 ; 1 5 [3] FORPREP 2 1 ; to 7 6 [4] MUL 1 1 5 7 [3] FORLOOP 2 -2 ; to 6 8 [6] RETURN 1 2 9 [7] RETURN 0 1
C API
Lua is intended to be embedded into other applications, and provides a C API for this purpose. The API is divided into two parts: the Lua core and the Lua auxiliary library. The Lua API's design eliminates the need for manual reference management in C code, unlike Python's API. The API, like the language, is minimalistic. Advanced functionality is provided by the auxiliary library, which consists largely of preprocessor macros which assist with complex table operations.
The Lua C API is stack based. Lua provides functions to push and pop most simple C data types integers, floats, etc. to and from the stack, as well as functions for manipulating tables through the stack. The Lua stack is somewhat different from a traditional stack; the stack can be indexed directly, for example. Negative indices indicate offsets from the top of the stack. For example, −1 is the top most recently pushed value, while positive indices indicate offsets from the bottom oldest value. Marshalling data between C and Lua functions is also done using the stack. To call a Lua function, arguments are pushed onto the stack, and then the lua_call is used to call the actual function. When writing a C function to be directly called from Lua, the arguments are read from the stack.
Here is an example of calling a Lua function from C:
#include <stdio.h>
#include <lua.h> // Lua main library lua_*
#include <lauxlib.h> // Lua auxiliary library luaL_*
int mainvoid
{
// create a Lua state
lua_State *L = luaL_newstate;
// load and execute a string
if luaL_dostringL, "function foo x,y return x+y end" {
lua_closeL;
return -1;
}
// push value of global "foo" the function defined above
// to the stack, followed by integers 5 and 3
lua_getglobalL, "foo";
lua_pushintegerL, 5;
lua_pushintegerL, 3;
lua_callL, 2, 1; // call a function with two arguments and one return value
printf"Result: %d\n", lua_tointegerL, -1; // print integer value of item at stack top
lua_popL, 1; // return stack to original state
lua_closeL; // close Lua state
return 0;
}
Running this example gives:
$ cc -o example example.c -llua $ ./example Result: 8
The C API also provides some special tables, located at various "pseudo-indices" in the Lua stack. At LUA_GLOBALSINDEX prior to Lua 5.2 is the globals table, _G from within Lua, which is the main namespace. There is also a registry located at LUA_REGISTRYINDEX where C programs can store Lua values for later retrieval.
It is possible to write extension modules using the Lua API. Extension modules are shared objects which can be used to extend the functionality of the interpreter by providing native facilities to Lua scripts. From the Lua side, such a module appears as a namespace table holding its functions and variables. Lua scripts may load extension modules using require, just like modules written in Lua itself. A growing collection of modules known as rocks are available through a package management system called LuaRocks, in the spirit of CPAN, RubyGems and Python eggs. Prewritten Lua bindings exist for most popular programming languages, including other scripting languages. For C++, there are a number of template-based approaches and some automatic binding generators.
Applications
In video game development, Lua is widely used as a scripting language by programmers, mainly due to its perceived easiness to embed, fast execution, and short learning curve.
In 2003, a poll conducted by GameDev.net showed Lua was the most popular scripting language for game programming. On 12 January 2012, Lua was announced as a winner of the Front Line Award 2011 from the magazine Game Developer in the category Programming Tools.
A large number of non-game applications also use Lua for extensibility, such as LuaTeX, an implementation of the TeX type-setting language, Redis, a key-value database, Neovim, a text editor, and Nginx, a web server.
Through the Scribunto extension, Lua is available as a scripting language in the ] Among its uses are allowing the integration of data from .
is also used in Roblox Studio to modify the game environment and developer usages.