Angelo Borsotti

Orcid: 0000-0001-6444-0361

According to our database1, Angelo Borsotti authored at least 12 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
General parsing with regular expression matching.
J. Comput. Lang., January, 2023

2022
A closer look at TDFA.
CoRR, 2022

2021
Fast GLR parsers for extended BNF grammars and transition networks.
J. Comput. Lang., 2021

Efficient POSIX submatch extraction on nondeterministic finite automata.
Softw. Pract. Exp., 2021

A deterministic parsing algorithm for ambiguous regular expressions.
Acta Informatica, 2021

2020
A Generalized LR(1) Parser or Extended Context-Free Grammars.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2019
A Benchmark Production Tool for Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2019

2018
Fast deterministic parsers for transition networks.
Acta Informatica, 2018

2015
BSP: A Parsing Tool for Ambiguous Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2015

From Ambiguous Regular Expressions to Deterministic Parsing Automata.
Proceedings of the Implementation and Application of Automata, 2015

2014
Complexity of Extended vs. Classic LR Parsers.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2009
Early action in an Earley parser.
Acta Informatica, 2009


  Loading...