Efficient recognition of context-free languages using dynamic programming approach

Recognition and parsing of context-free languages is one of the major activities of language processing systems. A large number of algorithms exist for parsing of general context-free languages and for the subset like programming and natural languages. This paper applies the dynamic programming approach for recognition of general context free languages. The solution to the problem has been obtained in O(logn) time using a specific system of processors. The paper describes the solution to a generalized problem for which the recognition and parsing is a case.