rem: try { var thisMatch = rootObj[i].word.match(re); } catch(e) {} 
add:  try { var thisMatch = rootObj[i].word.match(re); } catch(e) { /* printfire('error on '+re); */ } 
context: function intense_incrWords(selecObj,rootObj) {// try: first match the whole selectstring against the whole// rootstring, and find the index/offset of the first character of the// selectstring in the rootstring.  then split the rootstring... but// how do you know which array index corresponds to the offset?  do// selecObj[i].length until you get to the offset?// for each selection... for (var j=0; j<selecObj.length; j++) {    // for each word in the selection...   for (var k=0; k<selecObj[j].words.length; k++) {     // start at the object's predetermined arrayindex, and look only until you get to     // the arrayindex + the number of words in the selection...     var skip = 0;     for (var i=selecObj[j].arrayIndex; i<selecObj[j].words[k].length+selecObj[j].arrayIndex+2; i++) {       // I'm clueless as to why I need an additional [m] incrementer, but this so far produces       // my desired result       if (rootObj[i]) {	 var m=skip;	 var matched = '';	 if (selecObj[j].words[k][m]) {	   var re = new RegExp(''+deParen(selecObj[j].words[k][m])+'','m');	   if (re) {	     try { var thisMatch = rootObj[i].word.match(re); } catch(e) {}	   }	   if (thisMatch) {	     rootObj[i].intensity++;	     matched = 'true';	     rootObj[i].annotations.push(selecObj[j].rtid);	     skip++;	   }	   if (matched && ((m+1) == selecObj[j].words[k].length)) {	     // ? fixme?	     //skip++;	   }	 }       }     }   } }}
meta: 891	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/891/d81801bea5a832c839d00f7eb346766a61b5d1ee/stet-intense-shorter.js/buggy/stet-intense-shorter.js