Formal languages
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Noncounting Context-Free Languages
Journal of the ACM (JACM)
The use of grammatical inference for designing programming languages
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Balanced Grammars and Their Languages
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Input-Driven Languages are Recognized in log n Space
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Information and Computation
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Adding nesting structure to words
Journal of the ACM (JACM)
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Journal of Computer and System Sciences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Parsing Techniques: A Practical Guide
Parsing Techniques: A Practical Guide
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Parallel parsing of operator precedence grammars
Information Processing Letters
| Hi-index | 0.00 |
Floyd@?s operator precedence grammars and languages (FG, FL) are a classical subclass of deterministic context-free (DCF) grammars and languages. We prove that several recently introduced language families motivated by the needs of model checking and of specifying XML-like languages are proper subsets of FL. The main cases considered include visibly pushdown languages (VPL) and balanced languages (BALAN), which are characterized by restricted precedence relations. FL have all the closure properties available for regular languages and generally viewed as necessary for application to model checking: reversal, prefixing and suffixing, concatenation, Kleene star, and boolean operations. All but the last results are new, and some require complex proofs, due to the necessary changes of syntax structure. Thus FL are the largest known subfamily of DCF having the same closure properties as VPL. FG, unlike VPL grammars, which are intended for abstract syntax modelling, are structurally adequate to specify real programming languages.