Semantic Scholar uses AI to extract papers important to this topic.
Abstract“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation… Expand This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… Expand The first section of this chapter contains the definitions of context-free or algebraic languages by means of context-free… Expand Abstract Multiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984… Expand A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… Expand A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… Expand A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… Expand In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… Expand