Tree Grammar is a kind of highly dimensional grammar which can be used to represent the rules for creating 2 D and up objects.Tree Grammar will be extensively applied to Pattern Recognition and Visual Language.This paper introduces the concepts of I-abeded Tree,Connection and Labelled Tree Grammar based on related concepts of Tree Grammar.It also presents two algorithms for matching and recognizing labelled trees and provide a method to generate the parser for labelled tree grammars.