Precedence automata and languages

Authors:
Violetta Lonati;Dino Mandrioli;Matteo Pradella
Affiliations:
DSI, Università degli Studi di Milano, Milano, Italy;DEI, Politecnico di Milano, Milano, Italy;DEI, Politecnico di Milano, Milano, Italy
Venue:
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Year:
2011

Citing 10
Cited 1

Formal languages

Formal languages
Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Balanced grammars and their languages

Formal and natural computing
Some properties of precedence languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Adding nesting structure to words

Journal of the ACM (JACM)
Parsing Techniques: A Practical Guide

Parsing Techniques: A Practical Guide
Operator precedence and the visibly pushdown property

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Height-deterministic pushdown automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.