Sciweavers

CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 9 months ago
Precedence Automata and Languages
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...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
LATA
2010
Springer
14 years 7 months ago
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 fami...
Stefano Crespi-Reghizzi, Dino Mandrioli