org.kuali.rice.krms.util

Class RuleLogicExpressionParser

java.lang.Object

org.kuali.rice.krms.util.RuleLogicExpressionParser

public class RuleLogicExpressionParser
extends Object

This is a helper class that validates logical expressions and rebuild a tree based on a valid expression.

Author:

Kuali Student Team

Constructor Summary

Constructors

Constructor and Description
RuleLogicExpressionParser()

Method Summary

Methods

Modifier and Type	Method and Description
String	getExpression()
List<ExpressionToken>	getTokenList()
PropositionEditor	parseExpressionIntoRule(RuleEditor ruleEditor, RuleViewHelperService viewHelper) Method to rebuild the tree based on the set token list that was built from given expression.
PropositionEditor	ruleFromStack(Stack<ExpressionToken> tokenStack, Map<String,PropositionEditor> simplePropositions, Queue<PropositionEditor> compoundPropositions, RuleEditor rule, RuleViewHelperService viewHelper) Build the proposition tree from the token stack in reverse order.
void	setExpression(String expression)
boolean	validateExpression(List<String> errorMessages, List<String> keyList)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

RuleLogicExpressionParser

public RuleLogicExpressionParser()

Method Detail

validateExpression

public boolean validateExpression(List<String> errorMessages,
                         List<String> keyList)

setExpression

public void setExpression(String expression)

getExpression

public String getExpression()

getTokenList

public List<ExpressionToken> getTokenList()

parseExpressionIntoRule

public PropositionEditor parseExpressionIntoRule(RuleEditor ruleEditor,
                                        RuleViewHelperService viewHelper)

Method to rebuild the tree based on the set token list that was built from given expression.

Parameters:

ruleEditor -

viewHelper -

Returns:

PropositionEditor

ruleFromStack

public PropositionEditor ruleFromStack(Stack<ExpressionToken> tokenStack,
                              Map<String,PropositionEditor> simplePropositions,
                              Queue<PropositionEditor> compoundPropositions,
                              RuleEditor rule,
                              RuleViewHelperService viewHelper)

Build the proposition tree from the token stack in reverse order. If the token is a end parenthesis, recursively call this method again to resolve the inner group (compound proposition). When the next token is a start parenthesis, return the group. *

Parameters:

tokenStack -

simplePropositions -

compoundPropositions -

rule -

Returns: