Tom-Alexander

function pathFromPolygon(points) {
  var p = points.split(/\s+/);
  var path = '';
  for( var i = 0, len = p.length; i < len; i++ ) {
    path += (i && 'L' || 'M') + p[i]
  }
  return path;
}

Tom-Alexander

# Recursive descent parser
# http://adayinthepit.com/2011/07/19/hanging-in-the-treetops/
def exp(stack)
  token = stack.shift
  return stack if token =~ /[0-9]/ || token =~ /X/ && exp(stack) || token =~ /Y|Z/ && exp(stack) && exp(stack)
  false
end

def parse(source)
  stack = exp(source.split(''))