👉 In linguistics and computer science, an "arborator" is a type of parser that accepts only finite sequences of tokens, such as letters or numbers. These tokens are then used to build up the parse tree from the left to right, allowing the user to construct valid grammatical sentences by following the rules of syntax. Arborators are often used in natural language processing and automated theorem proving systems.
