-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcode.java
More file actions
48 lines (46 loc) · 1.26 KB
/
code.java
File metadata and controls
48 lines (46 loc) · 1.26 KB
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
import java.io.*;
import java.util.*;
class code {
public static void main(String args[]) {
Scanner sn = new Scanner(System.in);
int n;
int i,j;
System.out.println("Enter number of expressions you want?");
n=sn.nextInt();
String sla[]=new String[n];
String brkr[]=new String[n];
String brkl[]=new String[n];
for(i=0;i<n;i++) {
sla[i]=sn.next();
}
for(i=0;i<n;i++)
{
StringTokenizer stp=new StringTokenizer(sla[i],"=");
brkr[i]=stp.nextToken();
brkl[i]=stp.nextToken();
}
for(i=0;i<n;i++) {
for(j=0;j<n;j++)
{
if(i!=j) {
if(brkl[j].contains(brkl[i])) {
String str=brkl[j];
String searchQuery = brkl[i];
String replaceWord = brkr[i];
int startIndexVal = 0;
int endIndexVal = 0;
startIndexVal = str.indexOf(searchQuery);
endIndexVal = startIndexVal + searchQuery.length();
str = str.substring(0, startIndexVal) + replaceWord + str.substring(endIndexVal);
brkl[j]=str;
}
}
}
}
System.out.println("\nAfter common subexpression elimination:");
for(i=0;i<n;i++)
{
System.out.println(brkr[i]+"="+brkl[i]);
}
}
}