BSP (Berry-Sethi Parser) is a new SW tool for parsing ambiguous regular expressions (r.e.). Given a r.e., the BSP tool generates a DFA. Then the DFA processes the given input string, recognizes it and outputs, depending on user choice, all the syntax trees or just the one selected by either the Greedy or the POSIX criterion. The BSP tool is a HTML page including JavaScript code, and can be executed by any browser. It is self-documented and is intended for educational purposes. See http://github.com/breveglieri/ebs.
BSP: A Parsing Tool for Ambiguous Regular Expressions
BREVEGLIERI, LUCA ODDONE;CRESPI REGHIZZI, STEFANO;MORZENTI, ANGELO CARLO
2015-01-01
Abstract
BSP (Berry-Sethi Parser) is a new SW tool for parsing ambiguous regular expressions (r.e.). Given a r.e., the BSP tool generates a DFA. Then the DFA processes the given input string, recognizes it and outputs, depending on user choice, all the syntax trees or just the one selected by either the Greedy or the POSIX criterion. The BSP tool is a HTML page including JavaScript code, and can be executed by any browser. It is self-documented and is intended for educational purposes. See http://github.com/breveglieri/ebs.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
