/*
 * The Apache Software License, Version 1.1
 *
 *
 * Copyright (c) 2002-2003 The Apache Software Foundation.  All rights 
 * reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer. 
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * 3. The end-user documentation included with the redistribution,
 *    if any, must include the following acknowledgment:  
 *       "This product includes software developed by the
 *        Apache Software Foundation (http://www.apache.org/)."
 *    Alternately, this acknowledgment may appear in the software itself,
 *    if and wherever such third-party acknowledgments normally appear.
 *
 * 4. The names "Xalan" and "Apache Software Foundation" must
 *    not be used to endorse or promote products derived from this
 *    software without prior written permission. For written 
 *    permission, please contact apache@apache.org.
 *
 * 5. Products derived from this software may not be called "Apache",
 *    nor may "Apache" appear in their name, without prior written
 *    permission of the Apache Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * ====================================================================
 *
 * This software consists of voluntary contributions made by many
 * individuals on behalf of the Apache Software Foundation and was
 * originally based on software copyright (c) 1999, Lotus
 * Development Corporation., http://www.lotus.com.  For more
 * information on the Apache Software Foundation, please see
 * <http://www.apache.org/>.
 */
package org.apache.xpath.parser;

import java.util.Vector;

import org.apache.xpath.functions.Function;
import org.apache.xpath.operations.Variable;

public class PathExpr extends NonExecutableExpression
{
  public PathExpr(XPath parser)
  {
  	super(parser);
  }
    
  /**
   * Tell if this node is part of a PathExpr chain.  For instance:
   * <pre>
   * 	|UnaryExpr
   * 	|   PathExpr
   * 	|      StepExpr
   * 	|         AxisChild child::
   * 	|         NodeTest
   * 	|            NameTest
   * 	|               QName foo
   * 	|         Predicates   * 
   * </pre><br/>
   * In this example, UnaryExpr, PathExpr, and StepExpr should all return true.
   */
  public boolean isPathExpr()
  {
  	return true;
  }

	
//  public void jjtAddChild(Node n, int i) 
//  {
//  	n = fixupPrimarys(n);
//    if(null == m_exprs)
//    	m_exprs  = new Vector();
//  	if(i >= m_exprs.size())
//  	{
//  		m_exprs.setSize(i+1);
//  	}
//    m_exprs.setElementAt(n, i);
//  }
  
  public void jjtClose() 
  {
  	int size = m_exprs.size();
  	for(int i = size-1; i >= 0; i--)
  	{
  		SimpleNode node = (SimpleNode)m_exprs.elementAt(i);
  		if(node instanceof SlashOrSlashSlash)
  		{
  			boolean isSlashSlash = ((SlashOrSlashSlash)node).getisSlashSlash();
  			if(isSlashSlash)
  			{
  				node = new StepExpr(m_parser);
  				PatternAxis patAxis = new PatternAxis(org.apache.xml.xdm.Axis.DESCENDANTORSELF, m_parser);
  				patAxis.m_value = "descendant-or-self::"; // for diagnostics
  				NodeTest nt = new NodeTest(org.apache.xml.dtm.DTMFilter.SHOW_ALL, m_parser);
  				Predicates preds = new Predicates(m_parser);
  				node.jjtAddChild(patAxis, 0);
  				node.jjtAddChild(nt, 1);
  				node.jjtAddChild(preds, 2);
  				m_exprs.setElementAt(node, i);
  			}
  			else
  				m_exprs.removeElementAt(i);
  			// i--;
  		}
  		
  	}
  	Node child;
  	if((jjtGetNumChildren() == 1) 
  		&& (child = jjtGetChild(0)) instanceof StepExpr)
  	{
  		if(child.jjtGetNumChildren() == 2)
  		{
	  		StepExpr stepExpr = (StepExpr)child;
	  		if(stepExpr.getPredicates().jjtGetNumChildren() == 0)
	  		{
	  			Node varOrFunc = stepExpr.jjtGetChild(0);
	  			if(varOrFunc instanceof Variable 
	  			|| varOrFunc instanceof Function
	  			|| varOrFunc instanceof org.apache.xpath.patterns.FunctionPattern)
	  			{
	  				m_exprs.setElementAt(varOrFunc, 0);
	  				varOrFunc.jjtSetParent(this); // parent will continue to reduce.
	  			}
	  		}
  		}
  	}
  }
  

  /**
   * @see org.apache.xpath.parser.Node#jjtAddChild(Node, int)
   */
  public void jjtAddChild(Node n, int i)
  {
    if (n instanceof StepExpr && n.jjtGetChild(0) instanceof Variable)
    {
      if (null == m_exprs)
        m_exprs = new Vector();
      if (i >= m_exprs.size())
      {
        m_exprs.setSize(i + 1);
      }
      m_exprs.setElementAt(n, i);
    }
    else
      super.jjtAddChild(n, i);
  }

}