Some combinatorial arrays generated by context-free grammars

A context-free grammar G over an alphabet A is defined as a set of substitution rules that replace a letter in A by a formal function over A . The purpose of this paper is to show that some combinatorial arrays, such as the Catalan’s triangle, can be generated by context-free grammars in three variables.