Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infinite strings to perform for instance model checking.
Precedence automata and languages / V. Lonati, D. Mandrioli, M. Pradella - In: Computer science - theory and Applications : 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011 : proceedings / [a cura di] A. Kulikov, N. Vereshchagin. - Berlin : Springer, 2011. - ISBN 9783642207112. - pp. 291-304 (( Intervento presentato al 6. convegno International Computer Science Symposium in Russia, CSR 2011 tenutosi a St. Petersburg, Russia nel 2011 [10.1007/978-3-642-20712-9].
Precedence automata and languages
V. LonatiPrimo
;
2011
Abstract
Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infinite strings to perform for instance model checking.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
