Operator Precedence and the Visibly Pushdown Property
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean family, and have been recently shown to strictly include the Visibly Pushdown Languages (VPDL); the latter are FLs characterized by operator precedence relations determined by the alphabet partition. In this paper we give the non-obvious proves that FLs have the same closure properties that motivated the introduction of VPDLs, namely under reversal, concatenation and Kleene’s star. Thus, rather surprisingly, the historical FL family turns out to be the largest known deterministic context-free family that includes the VPDL and has the same closure properties needed for applications to model checking and for defining mark-up languages such as HTML. As a corollary, an extended regular expression of precedence-compatible FLs is a FL and a deterministic parser for it can be algorithmically obtained.
KeywordsModel Check Regular Expression Precedence Relation Regular Language Parse Tree
Unable to display preview. Download preview PDF.
- 1.Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC: ACM Symposium on Theory of Computing, STOC (2004)Google Scholar
- 2.Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)Google Scholar
- 5.Crespi Reghizzi, S.: The mechanical acquisition of precedence grammars. PhD thesis, University of California UCLA, School of Engineering (1970)Google Scholar
- 7.Crespi-Reghizzi, S., Mandrioli, D.: Algebraic properties of structured context-free languages: old approaches and novel developments. In: WORDS 2009 - 7th Int. Conf. on Words, preprints (2009), http://arXiv.org/abs/0907.2130
- 11.Grune, D., Jacobs, C.J.: Parsing techniques: a practical guide. Springer, New York (2008)Google Scholar