Operator Precedence ω-Languages
Recent literature extended the analysis of ω-languages from the regular ones to various classes of languages with “visible syntax structure”, such as visibly pushdown languages (VPLs). Operator precedence languages (OPLs), instead, were originally defined to support deterministic parsing and exhibit interesting relations with these classes of languages: OPLs strictly include VPLs, enjoy all relevant closure properties and have been characterized by a suitable automata family and a logic notation. We introduce here operator precedence ω-languages (ωOPLs), investigating various acceptance criteria and their closure properties. Whereas some properties are natural extensions of those holding for regular languages, others require novel investigation techniques.Application-oriented examples show the gain in expressiveness and verifiability offered by ωOPLs w.r.t. smaller classes.
Keywordsω-languages Operator precedence languages Push-down automata Closure properties Infinite-state model checking
Unable to display preview. Download preview PDF.
- 1.Alur, R., Madhusudan, P.: Adding nesting structure to words. Journ. ACM 56(3) (2009)Google Scholar
- 2.Barenghi, A., Crespi Reghizzi, S., Mandrioli, D., Pradella, M.: Parallel parsing of operator precedence grammars. Information Processing Letters (2013), doi:10.1016/j.ipl.2013.01.008Google Scholar
- 9.Grune, D., Jacobs, C.J.: Parsing techniques: a practical guide. Springer, New York (2008)Google Scholar
- 11.Lonati, V., Mandrioli, D., Pradella, M.: Logic Characterization of Invisibly Structured Languages: the Case of Floyd Languages. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 307–318. Springer, Heidelberg (2013)CrossRefGoogle Scholar
- 13.Panella, F.: Floyd languages for infinite words. Master’s thesis, Politecnico di Milano (2011), http://home.dei.polimi.it/panella
- 14.Panella, F., Pradella, M., Lonati, V., Mandrioli, D.: Operator precedence ω-languages. CoRR abs/1301.2476 (2013), http://arxiv.org/abs/1301.2476
- 15.Rabin, M.: Automata on infinite objects and Church’s problem. Regional conference series in mathematics. Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society (1972)Google Scholar
- 17.Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133–191. MIT Press, Cambridge (1990)Google Scholar