1 /*

     2  * Copyright (c) 2005, 2008, Oracle and/or its affiliates. All rights reserved.

     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

     4  *

     5  * This code is free software; you can redistribute it and/or modify it

     6  * under the terms of the GNU General Public License version 2 only, as

     7  * published by the Free Software Foundation.  Oracle designates this

     8  * particular file as subject to the "Classpath" exception as provided

     9  * by Oracle in the LICENSE file that accompanied this code.

    10  *

    11  * This code is distributed in the hope that it will be useful, but WITHOUT

    12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

    13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

    14  * version 2 for more details (a copy is included in the LICENSE file that

    15  * accompanied this code).

    16  *

    17  * You should have received a copy of the GNU General Public License version

    18  * 2 along with this work; if not, write to the Free Software Foundation,

    19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

    20  *

    21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

    22  * or visit www.oracle.com if you need additional information or have any

    23  * questions.

    24  */

    25 

    26 package com.sun.tools.javac.parser;

    27 

    28 import java.util.Map;

    29 import java.util.HashMap;

    30 import com.sun.tools.javac.tree.JCTree;

    31 import com.sun.tools.javac.tree.TreeInfo;

    32 

    33 import static com.sun.tools.javac.tree.JCTree.*;

    34 

    35 /**

    36  * This class is similar to Parser except that it stores ending

    37  * positions for the tree nodes.

    38  *

    39  * <p><b>This is NOT part of any supported API.

    40  * If you write code that depends on this, you do so at your own risk.

    41  * This code and its internal interfaces are subject to change or

    42  * deletion without notice.</b></p>

    43  */

    44 public class EndPosParser extends JavacParser {

    45 

    46     public EndPosParser(ParserFactory fac, Lexer S, boolean keepDocComments, boolean keepLineMap) {

    47         super(fac, S, keepDocComments, keepLineMap);

    48         this.S = S;

    49         endPositions = new HashMap<JCTree,Integer>();

    50     }

    51 

    52     private Lexer S;

    53 

    54     /** A hashtable to store ending positions

    55      *  of source ranges indexed by the tree nodes.

    56      *  Defined only if option flag genEndPos is set.

    57      */

    58     Map<JCTree, Integer> endPositions;

    59 

    60     /** {@inheritDoc} */

    61     @Override

    62     protected void storeEnd(JCTree tree, int endpos) {

    63         int errorEndPos = getErrorEndPos();

    64         endPositions.put(tree, errorEndPos > endpos ? errorEndPos : endpos);

    65     }

    66 

    67     /** {@inheritDoc} */

    68     @Override

    69     protected <T extends JCTree> T to(T t) {

    70         storeEnd(t, token.endPos);

    71         return t;

    72     }

    73 

    74     /** {@inheritDoc} */

    75     @Override

    76     protected <T extends JCTree> T toP(T t) {

    77         storeEnd(t, S.prevToken().endPos);

    78         return t;

    79     }

    80 

    81     @Override

    82     public JCCompilationUnit parseCompilationUnit() {

    83         JCCompilationUnit t = super.parseCompilationUnit();

    84         t.endPositions = endPositions;

    85         return t;

    86     }

    87 

    88     /** {@inheritDoc} */

    89     @Override

    90     JCExpression parExpression() {

    91         int pos = token.pos;

    92         JCExpression t = super.parExpression();

    93         return toP(F.at(pos).Parens(t));

    94     }

    95 

    96     /** {@inheritDoc} */

    97     @Override

    98     public int getEndPos(JCTree tree) {

    99         return TreeInfo.getEndPos(tree, endPositions);

   100     }

   101 

   102 }