public static void CheckLabeledStmtSeq(Vector stmtseq) throws ParseAlgorithmException {
  int i=0;
  while (i < stmtseq.size()) {
    AST.LabeledStmt stmt=(AST.LabeledStmt)stmtseq.elementAt(i);
    int ignore=ClassifyStmtSeq(stmt.stmts);
    i=i + 1;
  }
  ;
}

public static void CheckLabeledStmtSeq ( Vector stmtseq ) throws ParseAlgorithmException { int i = 0 ; while ( i < stmtseq . size ( ) ) { AST . LabeledStmt stmt = ( AST . LabeledStmt ) stmtseq . elementAt ( i ) ; int ignore = ClassifyStmtSeq ( stmt . stmts ) ; i = i + 1 ; } ; }
checking and fixing the ast * methods for checking the ast constructed from the simplified grammar , converting < labeledif > nodes to < if > nodes where appropriate , and checking that the ast obeys the actual grammar contained in the + cal document ( so the rules for where labels can appear are satisfied ) .
