Abstract
We define a new type of grammar, the global index grammars with regular base, based on the (general) global index grammars of Castano. We prove that the languages that they describe are a subset of the context-free languages and a proper superset of the visibly pushdown languages. We also prove that these languages are closed under union, e-free homomorphism, and intersection with regular languages. Additionally, we describe two subsets of the global index languages with regular base (rbGILs): the terminal restricted rbGILs and the well-nested word languages, and prove additional formal and closure properties of these languages.