Abstract

A generalized parenthesis languages (gpl. for short) is a cfl which roughly speaking shows the nesting property explicitly by using some terminal symbols as parentheses. In other words, it abstracts the block structure prevalent in modern programming languages. In this paper we study properties of gpl's in relation to regular sets and cfl's, and solve some decision problems mostly affirmatively. For example, we prove that the regularity problem for gpl's is decidable, and more generally that one can find for a given gpl a minimal set of parentheses that can express the resting property of the language.

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.