When graphically modeling plants

the process of L-system changes with different rule definitions. As a general method

a language parser based on L-system rules is presented in this paper. Firstly

this method acquires and constructs the parser of

through induction and abstraction

L-plants which is a language able to define various L-system rewrite rules. Secondly

the start state and the rules of L-system are recognized with the parser and then the rule replacement is executed to produce a string. At last

the shape grammar is used to model a specific plant while it parsing the string. This plant modeling method proves to be highly efficient with experiments and with it users can pay more attention to designing the shape of plants and defining the rules of L-system than to thinking about the details of how to replace in each step. This method also has good expansibility. When users want the parser to recognize other types of rules of L-system

they can simply add some new syntax expressions in syntax definition files.