DanH42

(function($) {
  $.fn.add = function(sep = " = ") {
    (function($this) {
      const re = /([0-9]+)/g;
      const n1 = re.exec($this.text());
      const n2 = re.exec($this.text());
      if ((n1 && n2) === null) return function(){};
      const a = parseInt(n1[0]);
      const b = parseInt(n2[0]);
  

DmitrySoshnikov

/**
 * = Recursive descent parser =
 *
 * MIT Style License
 * By Dmitry Soshnikov <dmitry.soshnikov@gmail.com>
 *
 * In this short lecture we'll cover the basic (non-predictive, backtracking)
 * recursive descent parsing algorithm.
 *
 * Recursive descent is an LL parser: scan from left to right, doing