This paper discusses the derivation of functional programs for grammar analysis problems, such as the EMPTY problem and the REACHABLE problem. Grammar analysis problems can be divided into two classes: top-down problems such as FOLLOW and REACHABLE, which are described in terms of the contexts of nonterminals, and bottom-up problems such as EMPTY and FIRST, which do not refer to contexts.