| Lua Programming Language |
Article Index for Lua |
Website Links For Lua |
Information AboutLua Programming Language |
In Computing , the Lua (pronounced LOO-ah, or in IPA ) Programming Language is a Lightweight , Reflective , Imperative and Procedural language, designed as a Scripting Language with Extensible Semantics as a primary goal. The name is derived from the Portuguese word for ''moon''. HISTORY Lua was created in 1993 by Roberto Ierusalimschy , Luiz Henrique De Figueiredo , and Waldemar Celes , members of the Computer Graphics Technology Group at PUC-Rio , the Pontifical University of Rio De Janeiro , in Brazil . 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 . Some of its closest relatives include Icon for its design and Python for its ease of use by non-programmers. 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. {Link without Title} Lua has been used in many applications, both commercial and non-commercial. See the Applications section for a detailed list. Lua has been used to program Homebrew applications for the Playstation Portable and the Nintendo DS . 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, rather than providing a more complex and rigid specification to match a single paradigm. Lua, for instance, does not contain explicit support for Inheritance , but allows it to be implemented relatively easily with metatables. Similarly, Lua allows programmers to implement Namespaces , Classes , and other related features using its single table implementation; First Class Function s allow the employment of many powerful 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 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 —in fact, the full reference Interpreter is only about 150kB 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, Number s (double-precision Floating Point by default), and Strings . Typical data structures such as Array s, Sets , Hash Table s, Lists , and Record s can be represented using Lua's single native data structure, the table, which is essentially a heterogeneous Map . Lua has no built-in support for namespaces and Object-oriented programming. Instead, metatable and metamethods are used to extend the language to support both programming paradigms in an elegant and straight-forward manner. Lua implements a small set of advanced features such as Higher-order Function s, Garbage Collection , First-class Function s, Closures , proper Tail Call s, Coercion (automatic conversion between string and number values at run time), Coroutine s (cooperative multitasking) and dynamic module loading. By including only a minimum set of data types, Lua attempts to strike a balance between power and size. Example code The classic Hello World Program can be written as follows: print "Hello, World!" The Factorial is an example of a Recursive function: function factorial(n) if n == 0 '''then''' return 1 end
end ''-- and runs to the end of the line'' Lua's treatment of functions as first class variables is shown in the following example, where the print function's behavior is modified: do local oldprint = print ''-- Store current print function as old print'' print = '''function'''(s) ''-- Redefine print function'' if s == "foo" '''then''' oldprint("bar") else oldprint(s) end end end Any future calls to "print" will now be routed through the new function, and thanks to 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 makeaddfunc(x) ''-- Return a new function that adds x to the argument'' return '''function'''(y) ''-- When we refer to the variable x, which is outside of the current'' ''-- scope and whose lifetime is shorter than that of this anonymous'' ''-- function, Lua creates a closure.'' return x + y end end plustwo = makeaddfunc(2) print(plustwo(5)) ''-- Prints 7'' A new closure for the variable x is created every time makeaddfunc is called, so that the anonymous function returned will always access its own x parameter. The closure is managed by Lua's garbage collector, just like any other object. Extensible semantics is a key feature of Lua, and the "metatable" concept allows Lua's tables to be customized in powerful and unique ways. The following example demonstrates an "infinite" table. For any n, fibs {Link without Title} will give the nth Fibonacci Number using Dynamic Programming . fibs = { 1, 1 } ''-- Initial values for fibs and fibs[2 .'' setmetatable(fibs, { ''-- Give fibs some magic behavior.'' __index = function(name, n) ''-- Call this function if fibs {Link without Title} does not exist.'' name = name[n - 1 + name - 2 ''-- Calculate and Memoize fibs[n].'' return name {Link without Title} end }) Tables Tables are the most important data structure (and, by design, the only complex data structure) in Lua, and are the foundation of all user-created types. The table is a collection of key and data pairs (known also as Hashed Heterogeneous Associative Array ), where the data is referenced by key. The key (index) can be of any data type except nil. An integer key of 1 is considered distinct from a string key of "1". Tables are created using the {} constructor syntax: a_table = {} ''-- Creates a new, empty table'' Tables are always passed by reference: a_table = {x = 10} ''-- Creates a new table, with one associated entry. The string x mapping to the number 10.'' print(a_table {Link without Title} ) ''-- Prints the value associated with the string key, in this case 10.'' b_table = a_table a_table {Link without Title} = 20 ''-- The value in the table is been changed to 20.'' print(a_table {Link without Title} ) ''-- Prints 20.'' print(b_table {Link without Title} ) ''-- Prints 20, because a_table and b_table both refer to the same table.'' Table as structure Tables are often used as Structure s (or objects) by using Strings as keys. Because such use is very common, Lua features a special syntax for accessing such fields. Example: point = { x = 10, y = 20 } ''-- Create new table'' print(point {Link without Title} ) ''-- Prints 10'' print(point.x) ''-- Has exactly the same meaning as line above'' Table as array By using a numerical key, the table resembles an Array data type. Lua arrays are 1-based; the first index is 1 rather than 0 as it is for many programming languages (though an explicit index of 0 is allowed). A simple array of strings: array = { "a", "b", "c", "d" } ''-- Indices are assigned automatically.'' print(array {Link without Title} ) ''-- Prints "b". Automatic indexing in Lua starts at 1.'' print(#array) ''-- Prints 4. # is the length operator for tables and strings.'' array {Link without Title} = "z" ''-- Zero is a legal index. print(#array) ''-- Still prints 4, as Lua arrays are 1-based. An array of objects: function Point(x, y) ''-- "Point" object Constructor '' return { x = x, y = y } ''-- Creates and returns a new object (table)'' end array = { Point(10, 20), Point(30, 40), Point(50, 60) } ''-- Creates array of points'' print(array {Link without Title} .y) ''-- Prints 40'' Object-oriented programming Although Lua does not have a built-in concept of s and tables. By simply placing functions and related data into a table, an object is formed. Inheritance (both single and multiple) can be implemented via the "metatable" mechanism, telling the object to lookup nonexistent methods and fields in parent object(s). There is no such concept as "class" with these techniques, rather "prototypes" are used as in Self Programming Language 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, you can use function table:func(args), which is equivalent to function table.func(self, args). Calling class methods also makes use of the colon: object:func(args) is equivalent to object.func(object, args). Creating a basic Vector object: Vector = { } ''-- Create a table to hold the class methods'' function Vector:new(x, y, z) ''-- The Constructor function'' object = { x = x, y = y, z = z } setmetatable(object, { ''-- Overload the index event so that fields not present within the object are'' ''-- looked up in the prototype Vector table'' __index = Vector }) return object end function Vector:mag() ''-- Declare another member function, to determine the Magnitude of the vector'' ''-- Reference the implicit object using Self ''
end local vec = Vector:new(0, 1, 0) ''-- Create a vector'' print(vec:mag()) ''-- Call a member function using ":"'' print(vec.x) ''-- Access a member variable using "."'' INTERNALS 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 transparent to the user and is performed during Run-time , but it can be done offline in order to increase performance or reduce the memory footprint of the host environment by leaving out the compiler. This example is the bytecode listing of the factorial function described above (in Lua 5.1.1): function 1 param, 3 slots, 0 upvalues, 1 local, 3 constants, 0 functions 1 {Link without Title} EQ 0 0 -1 ; - 0 2 {Link without Title} JMP 2 ; to 5 3 {Link without Title} LOADK 1 -2 ; 1 4 {Link without Title} RETURN 1 2 5 {Link without Title} GETGLOBAL 1 -3 ; factorial 6 {Link without Title} SUB 2 0 -2 ; - 1 7 {Link without Title} CALL 1 2 2 8 {Link without Title} MUL 1 0 1 9 {Link without Title} RETURN 1 2 10 {Link without Title} RETURN 0 1 There is also a free, third-party Just-in-time Compiler for the latest version (5.1) of Lua, called LuaJIT . It's very small (under 32kB of additional code) and can often improve the performance of a Lua program significantly. [http://luajit.org/luajit_performance.html] C API Lua is intended to be embedded into other applications, and accordingly it provides a robust, easy to use C API . The API is divided into two parts: the Lua core and the Lua auxiliary library [http://www.lua.org/manual/5.1/manual.html#4 . The Lua API is fairly straightforward because its unique 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 make complex table operations more palatable. The Lua Stack The Lua API makes extensive use of a global Stack which is used to pass parameters to and from Lua and C functions. 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 last element), while positive indices indicate offsets from the bottom. 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 popped from the stack. Special Tables The C API also provides several special tables, located at various "pseudo-indices" in the Lua stack. At LUA_GLOBALSINDEX 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. Extension Modules 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. Lua scripts may load extension modules using require {Link without Title} . Bindings to Other Languages
APPLICATIONS Lua, as a compiled binary, is very small by code standards. Coupled with it being relatively fast and having a very lenient license, it has gained a following among game developers for providing a viable scripting interface. Games
Other applications
A list of projects known to use Lua is located at Lua.org . BOOKS
TRIVIA
EXTERNAL LINKS
|
|
|