(Extended) Berry-Sethi algorithms for the recognition and parsing of a string generated by a regular expression. Both the "bs" and "bsp" tools are written in JavaScript and need an HTML browser to run. The browsers Firefox and Chrome are supported (not Explorer). File "bs.html" is the standard Berry-Sethi algorithm for constructing the recognizer DFA of a regular expression. File "bsp.html" is the extended Berry-Sethi algorithm for constructing the parser DFA of a regular expression, capable to recognize a string and also to build its syntax tree(s): one tree if the string is not ambiguous, and two or more trees if the string is ambiguous. The "bsp" tool can optionally use the Greedy and POSIX disambiguation criteria to select one tree only, if required. Both tools draw an interactive graphical representation of the recognizer or parser DFA they construct. The "bs" and "bsp" tools are user-friendly and self-documented: run them in a browser and have a look at the instructions in their interface page; all commands and data can be input into dialog boxes.
FLC-project/ebs
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Extended Berry-Sethi algorithms for the recognition and parsing of regular expressions. An HTML browser (FireFox or Chrome) is required to run the ebs tools.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published