Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Angelo Morzenti"'
We introduce a new parser generator, called Berry–Sethi Parser (BSP), for ambiguous regular expressions (RE). The generator constructs a deterministic finite-state transducer that recognizes an input string, as the classical Berry–Sethi algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c01bc508f2e829932ad12d9df99662a
http://hdl.handle.net/11311/1208974
http://hdl.handle.net/11311/1208974
The Tomita’s Generalized LR ( 1 ) parsing algorithm (GLR), later improved in many ways, runs in a linear time on LR ( 1 ) grammars, and degrades to a polynomial-time bound if the grammar is not deterministic. We address a useful feature not present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a260d33c115610a575084da166c9b9
http://hdl.handle.net/11311/1208976
http://hdl.handle.net/11311/1208976
Publikováno v:
Texts in Computer Science ISBN: 9783030048785
Texts in Computer Science ISBN: 9781447155133
Texts in Computer Science ISBN: 9781447155133
This chapter covers pushdown automata and parsing algorithms with emphasis on the application to syntax analysis. We start by introducing general and deterministic pushdown automata as recognizers of context-free and deterministic context-free langua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08f05235fc5365e286813c730fa2966c
https://doi.org/10.1007/978-3-030-04879-2_4
https://doi.org/10.1007/978-3-030-04879-2_4
Publikováno v:
Texts in Computer Science ISBN: 9783030048785
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfaaac6f8c0b50daea584bc7ee984826
https://doi.org/10.1007/978-3-030-04879-2_2
https://doi.org/10.1007/978-3-030-04879-2_2
Publikováno v:
Implementation and Application of Automata ISBN: 9783030236786
CIAA
CIAA
We describe a new tool, named REgen, that generates regular expressions (RE) to be used as test cases, and that generates also synthetic benchmarks for exercising and measuring the performance of RE-based software libraries and applications. Each gro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e09557f3dbb4c2f33e9281420d37266a
https://doi.org/10.1007/978-3-030-23679-3_8
https://doi.org/10.1007/978-3-030-23679-3_8
Publikováno v:
Texts in Computer Science ISBN: 9783030048785
Texts in Computer Science ISBN: 9781447155133
Texts in Computer Science ISBN: 9781447155133
In this chapter we introduce finite automata, discuss their properties, and present their role as recognizers of regular languages, in particular at the lexical level of compilation. After an overview of general string recognition algorithms and auto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c90ac1b1172c5e725718c49e15f028c1
https://doi.org/10.1007/978-3-030-04879-2_3
https://doi.org/10.1007/978-3-030-04879-2_3
Publikováno v:
Texts in Computer Science ISBN: 9783030048785
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d3ff80939f8dd8b7dcd12bfe80d2ee8
https://doi.org/10.1007/978-3-030-04879-2_1
https://doi.org/10.1007/978-3-030-04879-2_1
This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple tran
Extended BNF grammars (EBNF) allow regular expressions in the right parts of their rules. They are widely used to define languages, and can be represented by recursive Transition Networks (TN) consisting of a set of finite-state machines. We present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d616c4f9ee2fb3ee137a8e61273ee662
http://hdl.handle.net/11311/1120727
http://hdl.handle.net/11311/1120727