Documentation

MTokens with the positions of the next MToken (used in the advance of parser)

Custom parser that parses MTokens

Parse Garry's mod Lua tokens to an abstract syntax tree. Also returns parse errors

Parse a string directly into an AST

Parse a string directly

Create a parsable string from MTokens

Position in Region (as opposed to RegionProgression)

Text.ParserCombinators.UU.Utils.execParser modified to parse MTokens The first MToken might not be on the first line, so use the first MToken's position to start

Parse a single Metatoken, based on a positionless token (much like pSym)

Parse a list of identifiers

Parse list of function parameters

Parses the full AST Its first parameter contains all comments Assumes the mtokens fed to the AParser have no comments

Parse a block with an optional return value

A thing of which the region is to be parsed

Parser that is interleaved with 0 or more of the other parser

Behemoth parser that parses either function call statements or global declaration statements Big in size and complexity because prefix expressions are BITCHES The problem lies in the complexity of prefix expressions: hotten.totten["tenten"](tentoonstelling) -- This is a function call hotten.totten["tenten"] = tentoonstelling -- This is a declaration. hotten.totten["tenten"], tentoonstelling = 1, 2 -- This is also a declaration. One may find an arbitrary amount of expression suffixes (indexations/calls) before finding a comma or equals sign that proves that it is a declaration. Also, goto can be an identifier

Parse a single statement

Parse if then elseif then else end expressions

Parse numeric and generic for loops

Parse a return value

Label

Function name (includes dot indices and meta indices)

Local function name. Does not include dot and meta indices, since they're not allowed in meta functions

Parse a number into an expression

Parse any kind of string

Parse an identifier

Parse variable list (var1, var2, var3)

Parse local variable list (var1, var2, var3), without suffixes

list of expressions

Subexpressions, i.e. without operators

Separate parser for anonymous function subexpression

Parse operators of the same precedence in a chain

Parse unary operator (-, not, #)

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Operators, sorted by priority Priority from: http://www.lua.org/manual/5.2/manual.html#3.4.7

Parse chains of binary and unary operators

Parses a binary operator

Prefix expressions can have any arbitrary list of expression suffixes

Prefix expressions The suffixes define rules on the allowed suffixes

Parse any expression suffix

Parse an indexing expression suffix

Parse an indexing expression suffix

Function calls are prefix expressions, but the last suffix MUST be either a function call or a metafunction call

single variable. Note: definition differs from reference to circumvent the left recursion var ::= Name [{PFExprSuffix}* indexation] | '(' exp ')' {PFExprSuffix}* indexation where "{PFExprSuffix}* indexation" is any arbitrary sequence of prefix expression suffixes that end with an indexation

Arguments of a function call (including brackets)

Table constructor

A list of table entries Grammar: field {separator field} [separator]

Makes an unnamed field out of a list of suffixes, a position and a name. This function gets called when we know a field is unnamed and contains an expression that starts with a PrefixExp See the parseField parser where it is used

A field in a table

Field separator