Parse a string and create test cases

[Sriram Sharma]

Dear All,

Here is an assignment that I have taken up.
I am given a string, say for eg: if(a!=c || b!=c, true, false)
This means that if a!=c or b!=c, then validate as true, else validate as false.
Given this scenario I have to create all possible testcases for this string.
Eg:
1. a==c and b==c
2. a!=c
3. b!=cb

Currently I am only doing for the above said scenario; So I have not yet gone generic.
As a first step, I have managed to parse the string and populate a stack with each individual string
The challenge that I am facing is, how to create the test cases based on the stack values.
I am pretty clueless.
Can anyone in this forum help me please.

Thanks!

Regards,
Sriram

[Carey Brown]

Can you post what you've done so far?

[Junilu Lacar]

What does "each individual string" mean? What does your stack look like after you parse everything?

[Sriram Sharma]

Thanks for those who took time to reply to my question.

So here is my work till now.
The string that I am using is: if(a!=c || b!=c, true, false)
So, I need to create testcases in three different scenarios
All that I wish to do is something like this

1. a!=c:  true
2. b!=c: true
3. a==c and b==c: false

If not the same output, something which could fit on these lines.

    //if(a!=c || b!=c, true, false)
    private void createTestCase(String cellValue) {
    	Stack stack = parseToPopulateStack(cellValue);
   		stackScanner(stack);
    }

private String VALID_PATTERN = "[0,9]|[a-z]+|[=!]+|[()]+";
    
    //private String VALID_PATTERN="[^A-Z0-9]+|(?<=[A-Z])(?=[0-9])|(?<=[0-9])(?=[A-Z])";
    
    private Stack parseToPopulateStack(String toParse) {
    	Stack stack = new Stack();
    	List<String> words = new ArrayList<String>();
    	int beginIndex = 0;
    	int endIndex = 0;
    	while(endIndex<toParse.length()) {
>
    		while(endIndex<toParse.length() && toParse.substring(beginIndex, endIndex+1).matches(VALID_PATTERN)) {
>
    			endIndex++;
    		}
    		if(beginIndex!=endIndex) {
    			//words.add(toParse.substring(beginIndex, endIndex));
    			stack.push(toParse.substring(beginIndex, endIndex).trim());
    		}
    		else {
    			endIndex++;
    		}
    		beginIndex = endIndex;
    	}
    	System.out.println(stack);
    	return stack;
    }

//I intend to create those 3 different scenarios in this method by scanning through the stack. This is where I need help!!!
//Stack has the followinbg content after the push operations: [if, (, a, !=, b, ,, true, ,, false, )]
private void stackScanner(Stack stack) {
    	List al = new ArrayList();
    	if(stack.pop().equals("if")) {
    		if(stack.pop().equals("(")) {
    			al.add(stack.pop());
    		}
    		if(stack.pop().equals("!=")) {
    			
    		}
    	}
    }

Thanks.

Regards,
Sriram

[Junilu Lacar]

Looks to me like your implementation is too rudimentary and somewhat naive.

You'll need to write a state machine to parse boolean expressions. You need to define a grammar so that you know what state you're in, whether you're in an identifier, have read a separator, in an operator, etc.  A stack will help you keep track of your tokens and expressions and helps determine the order of evaluation.