This software utilizes EBNF and backtracking parsing algorithms to evaluate and manipulate strings through regular expressions, producing data trees as output.
The parsing process is carried out top-down, starting with a designated start rule, and backtracking as needed until a match is found. Upon finding a match, the parse tree is constructed. If specified, the evaluation subroutine is then carried out which may reject a match and affect which strings can be parsed.
Additionally, Parse::Stallion allows for flexible and customizable parsing, with a comprehensive list of optional parameters that can be modified upon initialization. These parameters allow the user to control the evaluation and parsing process, including start position, max steps for parsing, parse trace and more.
The rules supported by Parse::Stallion include AND, OR, MULTIPLE, LEAF and EVALUATION. Rules can be expressed using Extended Backus-Naur Form (EBNF), which are context free and can be used to construct complex grammars.
Overall, Parse::Stallion is a comprehensive and robust software tool for parsing and evaluating complex grammars, offering flexibility and ease of use for developers.
Version 1.00: N/A