Starting from the model proposed by means of Grammatical Evolution, we extended the applicability of the parallel and cooperative searching processes of Evolutionary Algorithms to a new topic, Tree Adjoining Grammars parsing. We evolved derived trees using a string-tree-representation. We also could use a linear matching function to compare the yield of a derived tree with a given input and the running tests present several encouraging results. Due to the higher degree of intrinsic parallelism Evolutionary Algorithms represent a new alternative to the highly complex classical methods used in Formal Computational Models.