recursive-descent-method/analyzer1.java at main · haronbh/recursive-descent-method · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
public class exo1 {
    private String input;
    int i;
    private boolean te;
    public exo1(String input){
          this.input = input + "#";
          this.i=0;
          this.te=true;
    }

    public void Z(){
        S();
         if(input.charAt(i)=='#'   && i ==input.length()-1 && te == true   ){
            System.out.println("chaine accepter ");
        } else
              System.out.println("chaine erronée "); }

    public void S(){
        if(input.charAt(i)== 'x'){
            i++;
        } else
            if(input.charAt(i)== 'y'){
                i++;
            } else
                if(input.charAt(i)=='('){
                    i++;
                    if(input.charAt(i)== 'x' || input.charAt(i)== 'y' || input.charAt(i)=='('  )
                    T();
                    if(input.charAt(i)==')'){
                i++;
            } else {
                       te = false; }
                }
    }
               public void T(){
                    if(input.charAt(i)== 'x' || input.charAt(i)== 'y' || input.charAt(i)=='('  ) {
                        S();
                        SS();
                    }
               }

                   public void SS(){
                        if(input.charAt(i)== ',') {

                        A();
                                }
                   }
        public void A(){
            if(input.charAt(i)== ',') {
                    i++;
                    S();
                    A();
            }
        }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
         System.out.println("Entrez une chaîne : ");
          String input = sc.nextLine();
          exo1 f = new exo1(input);
          f.Z();
    }
}