factorial-example.js

dionyziz@puppy ~/workspace/recursion-thm (master*) % cat examples/factorial.js
return (n) => {
  if (n == 0) {
    return 1
  }
  return n * eval(SELF)(n - 1)
}
dionyziz@puppy ~/workspace/recursion-thm (master*) % node compiler.js < examples/factorial.js > examples/factorial-compiled.js
dionyziz@puppy ~/workspace/recursion-thm (master*) % cat examples/factorial-compiled.js
(SELF => {return (n) => {
  if (n == 0) {
    return 1
  }
  return n * eval(SELF)(n - 1)
}
})((({BStr, TStr}) => {
    const AStr = ((BStr, TStr) => {
    const escape = (str) => {
      return str.replace(
        /\\/g, '\\\\'
      ).replace(
        /`/g, '\\\`'
      ).replace(
        /\$/g, '\\$'
      )
    }
    return `() => {
      return {
        BStr: \`${escape(BStr)}\`,
        TStr: \`${escape(TStr)}\`
      }
    }`
  })(BStr, TStr)

    return ((AStr, BStr, TStr) => {
    return `(SELF => {${TStr}})((${BStr})((${AStr})()))`
  })(AStr, BStr, TStr)
  })((() => {
      return {
        BStr: `({BStr, TStr}) => {
    const AStr = ((BStr, TStr) => {
    const escape = (str) => {
      return str.replace(
        /\\\\/g, '\\\\\\\\'
      ).replace(
        /\`/g, '\\\\\\\`'
      ).replace(
        /\\\$/g, '\\\\\$'
      )
    }
    return \`() => {
      return {
        BStr: \\\`\${escape(BStr)}\\\`,
        TStr: \\\`\${escape(TStr)}\\\`
      }
    }\`
  })(BStr, TStr)

    return ((AStr, BStr, TStr) => {
    return \`(SELF => {\${TStr}})((\${BStr})((\${AStr})()))\`
  })(AStr, BStr, TStr)
  }`,
        TStr: `return (n) => {
  if (n == 0) {
    return 1
  }
  return n * eval(SELF)(n - 1)
}
`
      }
    })()))
dionyziz@puppy ~/workspace/recursion-thm (master*) % node
> const fact = (SELF => {return (n) => {
...   if (n == 0) {
.....     return 1
.....   }
...   return n * eval(SELF)(n - 1)
... }
... })((({BStr, TStr}) => {
.....     const AStr = ((BStr, TStr) => {
.......     const escape = (str) => {
.........       return str.replace(
...........         /\\/g, '\\\\'
...........       ).replace(
...........         /`/g, '\\\`'
...........       ).replace(
...........         /\$/g, '\\$'
...........       )
.........     }
.......     return `() => {
.........       return {
...........         BStr: \`${escape(BStr)}\`,
...........         TStr: \`${escape(TStr)}\`
...........       }
.........     }`
.......   })(BStr, TStr)
.....
...     return ((AStr, BStr, TStr) => {
...     return `(SELF => {${TStr}})((${BStr})((${AStr})()))`
...   })(AStr, BStr, TStr)
...   })((() => {
...       return {
.....         BStr: `({BStr, TStr}) => {
.......     const AStr = ((BStr, TStr) => {
.........     const escape = (str) => {
...........       return str.replace(
.............         /\\\\/g, '\\\\\\\\'
.............       ).replace(
.............         /\`/g, '\\\\\\\`'
.............       ).replace(
.............         /\\\$/g, '\\\\\$'
.............       )
...........     }
.........     return \`() => {
...........       return {
.............         BStr: \\\`\${escape(BStr)}\\\`,
.............         TStr: \\\`\${escape(TStr)}\\\`
.............       }
...........     }\`
.........   })(BStr, TStr)
.......
...     return ((AStr, BStr, TStr) => {
...     return \`(SELF => {\${TStr}})((\${BStr})((\${AStr})()))\`
...   })(AStr, BStr, TStr)
...   }`,
...         TStr: `return (n) => {
...   if (n == 0) {
.....     return 1
.....   }
...   return n * eval(SELF)(n - 1)
... }
... `
...       }
...     })()))
undefined
> fact(6)
720
> %                                                                                                                                                                                      dionyziz@puppy ~/workspace/recursion-thm (master*) %