Precedence Automata and Languages

Details Precedence Automata and Languages Precedence Automata and Languages

2010-12-10

arxiv.org/abs/1012.2321v2

Computer Science

Formal Languages and Automata Theory

Extended version of the paper which appeared in Proceedings of CSR 2011, Lecture Notes in Computer Science, vol. 6651, pp. 291

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Precedence Automata and Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Precedence Automata and Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Precedence Automata and Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108231