text: /* global document, console, $, JSAV */
  
  $(document).ready(function () {
      "use strict";
  
      //////////////////////////////////////////////////////////////////
      // Get the parser produced by JISON and assign to parseTree3_grammar
      // Through the closing comment "End of parser", this is automatically
      // generated code and should not be altered.
      /////////////////////////////////////////////////////////////////
  
      /* parser generated by jison 0.4.17 */
      /*
        Returns a Parser object of the following structure:
  
        Parser: {
        yy: {}
        }
  
        Parser.prototype: {
        yy: {},
        trace: function(),
        symbols_: {associative list: name ==> number},
        terminals_: {associative list: number ==> name},
        productions_: [...],
        performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$),
        table: [...],
        defaultActions: {...},
        parseError: function(str, hash),
        parse: function(input),
  
        lexer: {
        EOF: 1,
        parseError: function(str, hash),
        setInput: function(input),
        input: function(),
        unput: function(str),
        more: function(),
        less: function(n),
        pastInput: function(),
        upcomingInput: function(),
        showPosition: function(),
        test_match: function(regex_match_array, rule_index),
        next: function(),
        lex: function(),
        begin: function(condition),
        popState: function(),
        _currentRules: function(),
        topState: function(),
        pushState: function(condition),
  
        options: {
        ranges: boolean           (optional: true ==> token location info will include a .range[] member)
        flex: boolean             (optional: true ==> flex-like lexing behaviour where the rules are tested exhaustively to find the longest match)
        backtrack_lexer: boolean  (optional: true ==> lexer regexes are tested in order and for each matching regex the action code is invoked; the lexer terminates the scan when a token is returned by the action code)
        },
  
        performAction: function(yy, yy_, $avoiding_name_collisions, YY_START),
        rules: [...],
        conditions: {associative list: name ==> set},
        }
        }
  
  
        token location info (@$, _$, etc.): {
        first_line: n,
        last_line: n,
        first_column: n,
        last_column: n,
        range: [start_number, end_number]       (where the numbers are indexes into the input string, regular zero-based)
        }
  
  
        the parseError function receives a 'hash' object with these members for lexer and parser errors: {
        text:        (matched text)
        token:       (the produced terminal token, if any)
        line:        (yylineno)
        }
        while parser (grammar) errors will also provide these members, i.e. parser errors deliver a superset of attributes: {
        loc:         (yylloc)
        expected:    (string describing the set of expected tokens)
        recoverable: (boolean: TRUE when the parser has a error recovery rule available for this particular error)
        }
      */
      var parseTree4_grammar = (function(){
  	var o=function(k,v,o,l){for(o=o||{},l=k.length;l--;o[k[l]]=v);return o},$V0=[1,4],$V1=[1,5],$V2=[1,7],$V3=[1,8],$V4=[1,9],$V5=[1,10],$V6=[5,7,8,9,10,13];
  	var parser = {trace: function trace() { },
  		      yy: {},
  		      symbols_: {"error":2,"program":3,"exp":4,"EOF":5,"trm":6,"PLUS":7,"MINUS":8,"TIMES":9,"DIV":10,"PRI":11,"LPAREN":12,"RPAREN":13,"$accept":0,"$end":1},
  		      terminals_: {2:"error",5:"EOF",7:"PLUS",8:"MINUS",9:"TIMES",10:"DIV",11:"PRI",12:"LPAREN",13:"RPAREN"},
  		      productions_: [0,[3,2],[4,1],[4,3],[4,3],[4,3],[4,3],[6,1],[6,3]],
  		      performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate /* action[1] */, $$ /* vstack */, _$ /* lstack */) {
  			  /* this == yyval */
  
  			  var $0 = $$.length - 1;
  			  switch (yystate) {
  			  case 1:
  			      return ['program',$$[$0-1]]; 
  			      break;
  			  case 2:
  			      this.$ = ['exp', $$[$0]]; 
  			      break;
  			  case 3:
  			      this.$ = ['exp',$$[$0-2], '+', $$[$0]]; 
  			      break;
  			  case 4:
  			      this.$ = ['exp',$$[$0-2], '-', $$[$0]]; 
  			      break;
  			  case 5:
  			      this.$ = ['exp',$$[$0-2], '*', $$[$0]]; 
  			      break;
  			  case 6:
  			      this.$ = ['exp',$$[$0-2], '/', $$[$0]]; 
  			      break;
  			  case 7:
  			      this.$ = ['trm',['pri', $$[$0]]]; 
  			      break;
  			  case 8:
  			      this.$ = ['trm', '(', $$[$0-1], ')']; 
  			      break;
  			  }
  		      },
  		      table: [{3:1,4:2,6:3,11:$V0,12:$V1},{1:[3]},{5:[1,6],7:$V2,8:$V3,9:$V4,10:$V5},o($V6,[2,2]),o($V6,[2,7]),{4:11,6:3,11:$V0,12:$V1},{1:[2,1]},{6:12,11:$V0,12:$V1},{6:13,11:$V0,12:$V1},{6:14,11:$V0,12:$V1},{6:15,11:$V0,12:$V1},{7:$V2,8:$V3,9:$V4,10:$V5,13:[1,16]},o($V6,[2,3]),o($V6,[2,4]),o($V6,[2,5]),o($V6,[2,6]),o($V6,[2,8])],
  		      defaultActions: {6:[2,1]},
  		      parseError: function parseError(str, hash) {
  			  if (hash.recoverable) {
  			      this.trace(str);
  			  } else {
  			      function _parseError (msg, hash) {
  				  this.message = msg;
  				  this.hash = hash;
  			      }
  			      _parseError.prototype = Error;
  
  			      throw new _parseError(str, hash);
  			  }
  		      },
  		      parse: function parse(input) {
  			  var self = this, stack = [0], tstack = [], vstack = [null], lstack = [], table = this.table, yytext = '', yylineno = 0, yyleng = 0, recovering = 0, TERROR = 2, EOF = 1;
  			  var args = lstack.slice.call(arguments, 1);
  			  var lexer = Object.create(this.lexer);
  			  var sharedState = { yy: {} };
  			  for (var k in this.yy) {
  			      if (Object.prototype.hasOwnProperty.call(this.yy, k)) {
  				  sharedState.yy[k] = this.yy[k];
  			      }
  			  }
  			  lexer.setInput(input, sharedState.yy);
  			  sharedState.yy.lexer = lexer;
  			  sharedState.yy.parser = this;
  			  if (typeof lexer.yylloc == 'undefined') {
  			      lexer.yylloc = {};
  			  }
  			  var yyloc = lexer.yylloc;
  			  lstack.push(yyloc);
  			  var ranges = lexer.options && lexer.options.ranges;
  			  if (typeof sharedState.yy.parseError === 'function') {
  			      this.parseError = sharedState.yy.parseError;
  			  } else {
  			      this.parseError = Object.getPrototypeOf(this).parseError;
  			  }
  			  function popStack(n) {
  			      stack.length = stack.length - 2 * n;
  			      vstack.length = vstack.length - n;
  			      lstack.length = lstack.length - n;
  			  }
  			  _token_stack:
  			  var lex = function () {
  			      var token;
  			      token = lexer.lex() || EOF;
  			      if (typeof token !== 'number') {
  				  token = self.symbols_[token] || token;
  			      }
  			      return token;
  			  };
  			  var symbol, preErrorSymbol, state, action, a, r, yyval = {}, p, len, newState, expected;
  			  while (true) {
  			      state = stack[stack.length - 1];
  			      if (this.defaultActions[state]) {
  				  action = this.defaultActions[state];
  			      } else {
  				  if (symbol === null || typeof symbol == 'undefined') {
  				      symbol = lex();
  				  }
  				  action = table[state] && table[state][symbol];
  			      }
  			      if (typeof action === 'undefined' || !action.length || !action[0]) {
  				  var errStr = '';
  				  expected = [];
  				  for (p in table[state]) {
  				      if (this.terminals_[p] && p > TERROR) {
  					  expected.push('\'' + this.terminals_[p] + '\'');
  				      }
  				  }
  				  if (lexer.showPosition) {
  				      errStr = 'Parse error on line ' + (yylineno + 1) + ':\n' + lexer.showPosition() + '\nExpecting ' + expected.join(', ') + ', got \'' + (this.terminals_[symbol] || symbol) + '\'';
  				  } else {
  				      errStr = 'Parse error on line ' + (yylineno + 1) + ': Unexpected ' + (symbol == EOF ? 'end of input' : '\'' + (this.terminals_[symbol] || symbol) + '\'');
  				  }
  				  this.parseError(errStr, {
  				      text: lexer.match,
  				      token: this.terminals_[symbol] || symbol,
  				      line: lexer.yylineno,
  				      loc: yyloc,
  				      expected: expected
  				  });
  			      }
  			      if (action[0] instanceof Array && action.length > 1) {
  				  throw new Error('Parse Error: multiple actions possible at state: ' + state + ', token: ' + symbol);
  			      }
  			      switch (action[0]) {
  			      case 1:
  				  stack.push(symbol);
  				  vstack.push(lexer.yytext);
  				  lstack.push(lexer.yylloc);
  				  stack.push(action[1]);
  				  symbol = null;
  				  if (!preErrorSymbol) {
  				      yyleng = lexer.yyleng;
  				      yytext = lexer.yytext;
  				      yylineno = lexer.yylineno;
  				      yyloc = lexer.yylloc;
  				      if (recovering > 0) {
  					  recovering--;
  				      }
  				  } else {
  				      symbol = preErrorSymbol;
  				      preErrorSymbol = null;
  				  }
  				  break;
  			      case 2:
  				  len = this.productions_[action[1]][1];
  				  yyval.$ = vstack[vstack.length - len];
  				  yyval._$ = {
  				      first_line: lstack[lstack.length - (len || 1)].first_line,
  				      last_line: lstack[lstack.length - 1].last_line,
  				      first_column: lstack[lstack.length - (len || 1)].first_column,
  				      last_column: lstack[lstack.length - 1].last_column
  				  };
  				  if (ranges) {
  				      yyval._$.range = [
  					  lstack[lstack.length - (len || 1)].range[0],
  					  lstack[lstack.length - 1].range[1]
  				      ];
  				  }
  				  r = this.performAction.apply(yyval, [
  				      yytext,
  				      yyleng,
  				      yylineno,
  				      sharedState.yy,
  				      action[1],
  				      vstack,
  				      lstack
  				  ].concat(args));
  				  if (typeof r !== 'undefined') {
  				      return r;
  				  }
  				  if (len) {
  				      stack = stack.slice(0, -1 * len * 2);
  				      vstack = vstack.slice(0, -1 * len);
  				      lstack = lstack.slice(0, -1 * len);
  				  }
  				  stack.push(this.productions_[action[1]][0]);
  				  vstack.push(yyval.$);
  				  lstack.push(yyval._$);
  				  newState = table[stack[stack.length - 2]][stack[stack.length - 1]];
  				  stack.push(newState);
  				  break;
  			      case 3:
  				  return true;
  			      }
  			  }
  			  return true;
  		      }};
  	/* generated by jison-lex 0.3.4 */
  	var lexer = (function(){
  	    var lexer = ({
  
  		EOF:1,
  
  		parseError:function parseError(str, hash) {
  		    if (this.yy.parser) {
  			this.yy.parser.parseError(str, hash);
  		    } else {
  			throw new Error(str);
  		    }
  		},
  
  		// resets the lexer, sets new input
  		setInput:function (input, yy) {
  		    this.yy = yy || this.yy || {};
  		    this._input = input;
  		    this._more = this._backtrack = this.done = false;
  		    this.yylineno = this.yyleng = 0;
  		    this.yytext = this.matched = this.match = '';
  		    this.conditionStack = ['INITIAL'];
  		    this.yylloc = {
  			first_line: 1,
  			first_column: 0,
  			last_line: 1,
  			last_column: 0
  		    };
  		    if (this.options.ranges) {
  			this.yylloc.range = [0,0];
  		    }
  		    this.offset = 0;
  		    return this;
  		},
  
  		// consumes and returns one char from the input
  		input:function () {
  		    var ch = this._input[0];
  		    this.yytext += ch;
  		    this.yyleng++;
  		    this.offset++;
  		    this.match += ch;
  		    this.matched += ch;
  		    var lines = ch.match(/(?:\r\n?|\n).*/g);
  		    if (lines) {
  			this.yylineno++;
  			this.yylloc.last_line++;
  		    } else {
  			this.yylloc.last_column++;
  		    }
  		    if (this.options.ranges) {
  			this.yylloc.range[1]++;
  		    }
  
  		    this._input = this._input.slice(1);
  		    return ch;
  		},
  
  		// unshifts one char (or a string) into the input
  		unput:function (ch) {
  		    var len = ch.length;
  		    var lines = ch.split(/(?:\r\n?|\n)/g);
  
  		    this._input = ch + this._input;
  		    this.yytext = this.yytext.substr(0, this.yytext.length - len);
  		    //this.yyleng -= len;
  		    this.offset -= len;
  		    var oldLines = this.match.split(/(?:\r\n?|\n)/g);
  		    this.match = this.match.substr(0, this.match.length - 1);
  		    this.matched = this.matched.substr(0, this.matched.length - 1);
  
  		    if (lines.length - 1) {
  			this.yylineno -= lines.length - 1;
  		    }
  		    var r = this.yylloc.range;
  
  		    this.yylloc = {
  			first_line: this.yylloc.first_line,
  			last_line: this.yylineno + 1,
  			first_column: this.yylloc.first_column,
  			last_column: lines ?
  			    (lines.length === oldLines.length ? this.yylloc.first_column : 0)
  			    + oldLines[oldLines.length - lines.length].length - lines[0].length :
  			this.yylloc.first_column - len
  		    };
  
  		    if (this.options.ranges) {
  			this.yylloc.range = [r[0], r[0] + this.yyleng - len];
  		    }
  		    this.yyleng = this.yytext.length;
  		    return this;
  		},
  
  		// When called from action, caches matched text and appends it on next action
  		more:function () {
  		    this._more = true;
  		    return this;
  		},
  
  		// When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
  		reject:function () {
  		    if (this.options.backtrack_lexer) {
  			this._backtrack = true;
  		    } else {
  			return this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n' + this.showPosition(), {
  			    text: "",
  			    token: null,
  			    line: this.yylineno
  			});
  
  		    }
  		    return this;
  		},
  
  		// retain first n characters of the match
  		less:function (n) {
  		    this.unput(this.match.slice(n));
  		},
  
  		// displays already matched input, i.e. for error messages
  		pastInput:function () {
  		    var past = this.matched.substr(0, this.matched.length - this.match.length);
  		    return (past.length > 20 ? '...':'') + past.substr(-20).replace(/\n/g, "");
  		},
  
  		// displays upcoming input, i.e. for error messages
  		upcomingInput:function () {
  		    var next = this.match;
  		    if (next.length < 20) {
  			next += this._input.substr(0, 20-next.length);
  		    }
  		    return (next.substr(0,20) + (next.length > 20 ? '...' : '')).replace(/\n/g, "");
  		},
  
  		// displays the character position where the lexing error occurred, i.e. for error messages
  		showPosition:function () {
  		    var pre = this.pastInput();
  		    var c = new Array(pre.length + 1).join("-");
  		    return pre + this.upcomingInput() + "\n" + c + "^";
  		},
  
  		// test the lexed token: return FALSE when not a match, otherwise return token
  		test_match:function (match, indexed_rule) {
  		    var token,
  		    lines,
  		    backup;
  
  		    if (this.options.backtrack_lexer) {
  			// save context
  			backup = {
  			    yylineno: this.yylineno,
  			    yylloc: {
  				first_line: this.yylloc.first_line,
  				last_line: this.last_line,
  				first_column: this.yylloc.first_column,
  				last_column: this.yylloc.last_column
  			    },
  			    yytext: this.yytext,
  			    match: this.match,
  			    matches: this.matches,
  			    matched: this.matched,
  			    yyleng: this.yyleng,
  			    offset: this.offset,
  			    _more: this._more,
  			    _input: this._input,
  			    yy: this.yy,
  			    conditionStack: this.conditionStack.slice(0),
  			    done: this.done
  			};
  			if (this.options.ranges) {
  			    backup.yylloc.range = this.yylloc.range.slice(0);
  			}
  		    }
  
  		    lines = match[0].match(/(?:\r\n?|\n).*/g);
  		    if (lines) {
  			this.yylineno += lines.length;
  		    }
  		    this.yylloc = {
  			first_line: this.yylloc.last_line,
  			last_line: this.yylineno + 1,
  			first_column: this.yylloc.last_column,
  			last_column: lines ?
                              lines[lines.length - 1].length - lines[lines.length - 1].match(/\r?\n?/)[0].length :
                              this.yylloc.last_column + match[0].length
  		    };
  		    this.yytext += match[0];
  		    this.match += match[0];
  		    this.matches = match;
  		    this.yyleng = this.yytext.length;
  		    if (this.options.ranges) {
  			this.yylloc.range = [this.offset, this.offset += this.yyleng];
  		    }
  		    this._more = false;
  		    this._backtrack = false;
  		    this._input = this._input.slice(match[0].length);
  		    this.matched += match[0];
  		    token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);
  		    if (this.done && this._input) {
  			this.done = false;
  		    }
  		    if (token) {
  			return token;
  		    } else if (this._backtrack) {
  			// recover context
  			for (var k in backup) {
  			    this[k] = backup[k];
  			}
  			return false; // rule action called reject() implying the next rule should be tested instead.
  		    }
  		    return false;
  		},
  
  		// return next match in input
  		next:function () {
  		    if (this.done) {
  			return this.EOF;
  		    }
  		    if (!this._input) {
  			this.done = true;
  		    }
  
  		    var token,
  		    match,
  		    tempMatch,
  		    index;
  		    if (!this._more) {
  			this.yytext = '';
  			this.match = '';
  		    }
  		    var rules = this._currentRules();
  		    for (var i = 0; i < rules.length; i++) {
  			tempMatch = this._input.match(this.rules[rules[i]]);
  			if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {
  			    match = tempMatch;
  			    index = i;
  			    if (this.options.backtrack_lexer) {
  				token = this.test_match(tempMatch, rules[i]);
  				if (token !== false) {
  				    return token;
  				} else if (this._backtrack) {
  				    match = false;
  				    continue; // rule action called reject() implying a rule MISmatch.
  				} else {
  				    // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
  				    return false;
  				}
  			    } else if (!this.options.flex) {
  				break;
  			    }
  			}
  		    }
  		    if (match) {
  			token = this.test_match(match, rules[index]);
  			if (token !== false) {
  			    return token;
  			}
  			// else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
  			return false;
  		    }
  		    if (this._input === "") {
  			return this.EOF;
  		    } else {
  			return this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\n' + this.showPosition(), {
  			    text: "",
  			    token: null,
  			    line: this.yylineno
  			});
  		    }
  		},
  
  		// return next match that has a token
  		lex:function lex() {
  		    var r = this.next();
  		    if (r) {
  			return r;
  		    } else {
  			return this.lex();
  		    }
  		},
  
  		// activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
  		begin:function begin(condition) {
  		    this.conditionStack.push(condition);
  		},
  
  		// pop the previously active lexer condition state off the condition stack
  		popState:function popState() {
  		    var n = this.conditionStack.length - 1;
  		    if (n > 0) {
  			return this.conditionStack.pop();
  		    } else {
  			return this.conditionStack[0];
  		    }
  		},
  
  		// produce the lexer rule set which is active for the currently active lexer condition state
  		_currentRules:function _currentRules() {
  		    if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {
  			return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;
  		    } else {
  			return this.conditions["INITIAL"].rules;
  		    }
  		},
  
  		// return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
  		topState:function topState(n) {
  		    n = this.conditionStack.length - 1 - Math.abs(n || 0);
  		    if (n >= 0) {
  			return this.conditionStack[n];
  		    } else {
  			return "INITIAL";
  		    }
  		},
  
  		// alias for begin(condition)
  		pushState:function pushState(condition) {
  		    this.begin(condition);
  		},
  
  		// return the number of states currently on the stack
  		stateStackSize:function stateStackSize() {
  		    return this.conditionStack.length;
  		},
  		options: {},
  		performAction: function anonymous(yy,yy_,$avoiding_name_collisions,YY_START) {
  		    var YYSTATE=YY_START;
  		    switch($avoiding_name_collisions) {
  		    case 0:/* no return statement, so skip whitespace */
  			break;
  		    case 1:return "PRI"
  			break;
  		    case 2:return "TIMES"
  			break;
  		    case 3:return "DIV"
  			break;
  		    case 4:return "MINUS"
  			break;
  		    case 5:return "PLUS"
  			break;
  		    case 6:return "LPAREN"
  			break;
  		    case 7:return "RPAREN"
  			break;
  		    case 8:return "EOF"
  			break;
  		    case 9:return "INVALID"
  			break;
  		    }
  		},
  		rules: [/^(?:\s+)/,/^(?:[A-Z])/,/^(?:\*)/,/^(?:\/)/,/^(?:-)/,/^(?:\+)/,/^(?:\()/,/^(?:\))/,/^(?:$)/,/^(?:.)/],
  		conditions: {"INITIAL":{"rules":[0,1,2,3,4,5,6,7,8,9],"inclusive":true}}
  	    });
  	    return lexer;
  	})();
  	parser.lexer = lexer;
  	function Parser () {
  	    this.yy = {};
  	}
  	Parser.prototype = parser;parser.Parser = Parser;
  	return new Parser;
      })();
  
  
      // End of parser
      // Code after this does the actual AV
  
      //////////////////////////////// parseTree4_grammar now has the parser
      
      
      JSAV.init();
      JSAV.ext.SPEED = 500;
      var av;
  
      // Use this instatiation for embedding in standalone html file
      //        av = new JSAV($("#parseTree"));
      //////////////////////////////////////////////////////
  
      // Use this instantiation for embedding in RST file
      var av_name = "parseTree4";
      var interpret = ODSA.UTILS.loadConfig({"av_name": av_name}).interpreter;
      av = new JSAV(av_name);
      //////////////////////////////////////////////////////
  
      var lt = "&lt;";
      var gt = "&gt;";
      var empty_prod = "&epsilon;";
      var arr;
      var tree;
      var label1;
      var label2;
  
      var the_tree = "";		// String representation of the tree
  
      // A  + B * C
      // A + B * C + ( E * F + G )
  
      //    var the_exp = "A + B * C";	// The expression to parse
      var the_exp = "A + B * C";	// The expression to parse
      the_exp = the_exp.replace(/\s/g,'');	// Squeeze spaces from the string
      var the_parse_tree = parseTree4_grammar.parse(the_exp);
  
  
      var build_jsav_tree = function(node, parent) {
  	//    document.getElementById('parse-result').innerHTML = s;
  
  	var n;
  	var i;
  	if (parent === null) {
  	    n = tree.newNode(lt+node[0]+gt); // node[0] should be "exp"
  	    n.addClass("wider");
  	    tree.root(n);
  	    for (i = 1; i < node.length; i++) { // now recursively process the children
  		build_jsav_tree(node[i], n);
  	    }
  	} else if (Array.isArray(node)) {
   	    n = tree.newNode(lt+node[0]+gt);
   	    n.addClass("wider");
   	    parent.addChild(n);
   	    for (i = 1; i < node.length; i++) { // now recursively process the children
   		build_jsav_tree(node[i], n);
  	    }
  	} else {
   	    n = tree.newNode(node);
  	    //	    n.addClass("wider");
   	    parent.addChild(n);
  	}
      };
  
      var display_parse = function (nodes, arr_index_to_highlight) {
  	
  	if (nodes.length === 0) return;
  	var node = nodes.shift();
  	if (node.child(0) === undefined && node.value() !== empty_prod) {
  	    label1.text("\nParsing terminal " + node.value());
  	    node.addClass("jsavhighlight");
  	    arr.addClass(arr_index_to_highlight, "jsavhighlight");
  	    arr_index_to_highlight++;
  	    av.step();
  	}
  	console.log("node " + node.value());
  	var i = 0;
  	var temp = [];
  	label1.text("\nParsing non-terminal " + node.value());
  	while (node.child(i) !== undefined) {
  	    node.child(i).show( {recursive: false} );
  	    temp.push(node.child(i));
  	    i = i + 1;
  	}
  	if (temp.length !== 0) {
  	    av.step();
  	}
  	
  	while (temp.length !== 0) {
  	    nodes.unshift(temp.pop());
  	}
  	display_parse(nodes, arr_index_to_highlight);
      };
  
  
  
      //%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
      //    arr = av.ds.array(the_exp.split(" "));
      arr = av.ds.array(the_exp.split("")); // Spaces have been squeezed from the_exp by the time this happens, splitting with an empty string yields an array of the non-space characters
      arr.addClass(true, "oneCharWidth");
      label1 = av.label("\nBeginning the parse ");
      av.umsg(" ");
      tree = av.ds.tree({nodegap: 10});
  
      // Build the JSAV tree representation of the JISON parse tree
      build_jsav_tree(the_parse_tree[1], null); // Skip the program node from the JISON grammar, which occurs at index 0
  
      tree.layout();
      //    av.step();
      tree.root().child(0).hide();
      tree.root().child(1).hide();
      tree.root().child(2).hide();
      av.displayInit();
      // Now display the parse tree in stages
      display_parse([tree.root()], 0);
  
  
      av.recorded();
  
      // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  
  });
  