Produktionsregel
S->bX|bSb, X->AXa|a, bAa->aba, bab->abb, bAA->AAb, Aab->aab
Wenn es determiniert: (JavaScript)
/* * output = Enthält die Ausgabe im unteren blauen Kasten * word = Enthält das Wort. * */ output += '<br>'; var potenz=[]; var count = 0; var arrx = Array.from(word); arrx.forEach(function callback(v,k){ count++; if((k==arrx.length-1) || (v != arrx[k+1])){ output +=v+'<sup>'+count+'</sup>'; potenz.push(parseInt(count)); count = 0; } }); var countPot = potenz.length; if(countPot==2){ if(potenz[0]==1 && potenz[1]==1){ output += '<span class="text-green">OK</span>'; }else{ output += '<span class="text-red">ERROR</span>'; } } if(countPot==3){ if((potenz[0]+1)==potenz[2] && potenz[1]==1){ output += '<span class="text-green">OK</span>'; }else{ output += '<span class="text-red">ERROR</span>'; } } if(countPot==4){ if(potenz[2]==(potenz[0]+1) && potenz[1]==(potenz[3]+1)){ output += '<span class="text-green">OK</span>'; }else{ output += '<span class="text-red">ERROR</span>'; } } if(countPot>4){ output += '<span class="text-red">ERROR</span>'; }
Neustart!
Sprache generieren!
S
## LOAD ##
## LOAD ##