如何将带有子树的ParserRuleContext
展平为一系列令牌? ParserRuleContext.getTokens(int ttype)
看起来不错。但是什么是ttype
?它是令牌类型吗?如果我想包含所有令牌类型,可以使用什么值?
答案 0 :(得分:4)
ParserRuleContext.getTokens(int ttype)
只检索父节点的某些子节点:它不会递归进入父树。
然而,写自己很容易:
/**
* Retrieves all Tokens from the {@code tree} in an in-order sequence.
*
* @param tree
* the parse tee to get all tokens from.
*
* @return all Tokens from the {@code tree} in an in-order sequence.
*/
public static List<Token> getFlatTokenList(ParseTree tree) {
List<Token> tokens = new ArrayList<Token>();
inOrderTraversal(tokens, tree);
return tokens;
}
/**
* Makes an in-order traversal over {@code parent} (recursively) collecting
* all Tokens of the terminal nodes it encounters.
*
* @param tokens
* the list of tokens.
* @param parent
* the current parent node to inspect for terminal nodes.
*/
private static void inOrderTraversal(List<Token> tokens, ParseTree parent) {
// Iterate over all child nodes of `parent`.
for (int i = 0; i < parent.getChildCount(); i++) {
// Get the i-th child node of `parent`.
ParseTree child = parent.getChild(i);
if (child instanceof TerminalNode) {
// We found a leaf/terminal, add its Token to our list.
TerminalNode node = (TerminalNode) child;
tokens.add(node.getSymbol());
}
else {
// No leaf/terminal node, recursively call this method.
inOrderTraversal(tokens, child);
}
}
}