孤立的案例错误

Question

我一直收到错误＆＃34;孤立的案例＆＃34;在这段代码上。我查看了它吐出错误的原因，但至于我可以看到那里没有任何东西。我尝试完全重做该段，但仍然出现同样的错误。任何人都可以帮我解决这个错误吗？

代码段

case '<': 
                         if(flag2 == false || stack.size() == 2)
                         {
                            if(flag2 == false)
                               a = 1;
                            temp = stack.removeLast();
                            temp2 = stack.removeLast();


                            for(int iii = 0; iii < el.size(); iii++)
                            {
                               if(el.get(iii) == temp)
                               {
                                  for(int jii = 0; jii < el.size(); jii++)
                                  {
                                     if(el.get(jii) == temp2)
                                     {
                                        for(int kii = 0; kii < mop; kii++)
                                        {
                                           if((lamp[kii][iii] == 1 && lamp[kii][jii] == 1) || (lamp[kii][iii] == 0 && lamp[kii][jii] == 0))
                                              bam[kii][test2+a] = true;
                                           else
                                              bam[kii][test2+a] = false;
                                        }
                                     }
                                  }


                               }

                            }

                            test2 = test2+a;
                            flag2 = true;
                            a = 0;

                         }
                         else
                        {
                           if(stack.size() != 0)
                              temp = stack.removeLast();
                           else
                           {
                              a = -1;
                              temp = ' ';
                           }
                           //for(int poop = 0; poop < mop; poop++)
                              //System.out.println(las.get(poop));

                           if(stack.size() != 0)
                           for(int ikk = 0; ikk < el.size(); ikk++)
                           {
                              if(temp == el.get(ikk))
                              {
                                 for(int jkk = 0; jkk < mop; jkk++)
                                 {
                                    if(lamp[jkk][ikk] == 0)
                                       bam[jkk][test2 + 1 + a] = false;
                                    else
                                       bam[jkk][test2 + 1 + a] = true;
                                 }

                              }
                            //  System.out.println(flag2);

                           }

                           for(int ill = 0; ill < mop; ill++)
                              {
                                 if((!bam[ill][test2 + a] && !bam[ill][test2+1+a]) || (bam[ill][test2+1+a] && bam[ill][test2+a]))
                                    bam[ill][test2+2+a] = true;
                                 else
                                    bam[ill][test2+2+a] = false;
                              }

                              test2 = test2 + 2 + a;
                              a = 0;
                         }
                         break;