01: /*
02: [The "BSD licence"]
03: Copyright (c) 2005-2006 Terence Parr
04: All rights reserved.
05:
06: Redistribution and use in source and binary forms, with or without
07: modification, are permitted provided that the following conditions
08: are met:
09: 1. Redistributions of source code must retain the above copyright
10: notice, this list of conditions and the following disclaimer.
11: 2. Redistributions in binary form must reproduce the above copyright
12: notice, this list of conditions and the following disclaimer in the
13: documentation and/or other materials provided with the distribution.
14: 3. The name of the author may not be used to endorse or promote products
15: derived from this software without specific prior written permission.
16:
17: THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19: OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20: IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21: INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22: NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23: DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24: THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25: (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26: THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27: */
28: package org.antlr.tool;
29:
30: import org.antlr.analysis.DecisionProbe;
31: import org.antlr.stringtemplate.StringTemplate;
32:
33: import java.util.*;
34:
35: /** More a single alternative recurses so this decision is not regular. */
36: public class NonRegularDecisionMessage extends Message {
37: public DecisionProbe probe;
38: public Set altsWithRecursion;
39:
40: public NonRegularDecisionMessage(DecisionProbe probe,
41: Set altsWithRecursion) {
42: super (ErrorManager.MSG_NONREGULAR_DECISION);
43: this .probe = probe;
44: this .altsWithRecursion = altsWithRecursion;
45: }
46:
47: public String toString() {
48: GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode();
49: line = decisionASTNode.getLine();
50: column = decisionASTNode.getColumn();
51: String fileName = probe.dfa.nfa.grammar.getFileName();
52: if (fileName != null) {
53: file = fileName;
54: }
55:
56: StringTemplate st = getMessageTemplate();
57: String ruleName = probe.dfa.getNFADecisionStartState()
58: .getEnclosingRule();
59: st.setAttribute("ruleName", ruleName);
60: List sortedAlts = new ArrayList();
61: sortedAlts.addAll(altsWithRecursion);
62: Collections.sort(sortedAlts); // make sure it's 1, 2, ...
63: st.setAttribute("alts", sortedAlts);
64:
65: return super.toString(st);
66: }
67:
68: }
|