Abstract

We consider in this paper so called simple bracketed languages having special limita- tions. They are sometimes used for the definitions of some grammatical structures of programming languages. Generally speaking, these languages are context-free, but not deterministic context- free, i.e., they cannot be defined by deterministic push-down automata. For the simple bracketed languages having special limitations, the equivalence problem is decidable. We obtain the sufficient conditions for the representation some language by special sequences of simple bracketed languages. We also consider the examples of grammatical structures as the simple bracketed languages. Therefore, we can decide equivalence problem for some grammatical structures of programming languages, and such structures define neither regular, nor deterministic context-free languages.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.