JAVA实现L-System树形绘制

import java.awt.Color;
import java.util.Scanner;

import Ynu.Sei.cpLibrary.BASIC.cpDraw;
import Ynu.Sei.cpLibrary.DS.cpStack;

public class main {

/**
 * @param args
 */
public static void main(String[] args) {
// TODO Auto-generated method stub
double angle, n, penWidth, Length;
String str = new String("F");
String newstr = new String();
String rule = new String("FF+[+F-F-F]-[-F+F+F]");
System.out.println("请输入LSystem的相关参数：");
System.out.println("请输入迭代规则：");
Scanner scan = new Scanner(System.in);
rule = scan.next();
System.out.print("请输入每次偏转的角度：");
Scanner scan0 = new Scanner(System.in);
angle = scan0.nextDouble();
System.out.print("请输入最大迭代步数：");
Scanner scan1 = new Scanner(System.in);
n = scan1.nextDouble();
System.out.print("请输入划线的初始宽度：");
Scanner scan2 = new Scanner(System.in);
penWidth = scan2.nextDouble();

System.out.print("请输入划线的初始长度：");
Scanner scan3 = new Scanner(System.in);
Length = scan3.nextDouble();

for (int k = 0; k < n; k++) {
newstr = str.replace("F", rule);
str = newstr;
}
System.out.println(newstr);
Lstate es = new Lstate();
es.penWidth = penWidth;
es.penLength = Length;
Lsystem ec = new Lsystem(rule, es, angle);
for (int i = 0; i < newstr.length(); i++) {
char now = newstr.charAt(i);
if (now == 'F')
ec.Forward();
else if (now == '+')
ec.plusTheta();
else if (now == '-')
ec.minusTheta();
else if (now == '[')
ec.pushS();
else if (now == ']')
ec.popS();

}

}
}