Make a Unicorn interpreter Recently, I made a made a typo and I wrote unicorn instead of unicode, I did what any normal person would do and I made an esolang out of it. In this challenge you will be writing a Unicorn interpreter.

Because Unicorn programs are horrible long, you'll have to write a short interpreter to compensate for this.

Example

These are the transpiled result, not the actual interpreted result your program should output


1

                                                      
alert([x=(p=prompt())/2+Math.sqrt(p*p/4-prompt()),p-x])

              
"Hello, World!"


Specification


Unicorn is divided into "sections" which are space-separated
Each section represents a character
The number of unicorns () in each section is converted to it's associated character (i.e. 32 unicorns -> chr(32) -> ).
If the section contains goats (), the length of the amount of goats should be doubled, then converted to the associated character
If the section contains any other characters, the program should ignore the character.
Each section (character) should be joined to form a program
This resulting program should be evaluated in the language you have written the program in. (e.g. JavaScript's eval, Python's exec)
Unicorns are unicode U+1F984; goats are unicode U+1F410.
If you choose a compiled language, you may output/save the compiled, compiled unicorn code


 (unicorns) and  (goats) all count as one byte for this challenge.

If your language doesn't support emojis, you may identify unicorns as (u) and goats as (g). You may not support emojis and u,g



If you really want to see the unicodes unicorns, here is a picture of this post



+50 bounty: to the shortest program in (the original) Unicorn while being under 6500 chars. You must use this version, it must run on Firefox, Chrome, or Safari.
Unicorn (ES6), 5934 5278 bytes





Under the custom encoding, this is 5278 bytes (1 byte per char); but with UTF-8, it would 4 bytes per char (though only 1 for a space), or 20869 total.

(too many Unicorns and Goats to reasonably display here)


Instead, here's a pastebin. This Unicorn code transpiles to this JS snippet:

s=&gt;eval(s.replace(/\S+ ?/g,c=&gt;String.fromCharCode(c.length&gt;&gt;1&lt;&lt;c.charCodeAt()%2)))


Now, this isn't the shortest possible version; this is shorter:

s=&gt;eval(s.replace(/\S+ ?/g,c=&gt;String.fromCharCode(c.length&gt;&gt;1&lt;&lt;(""&gt;c))))


However, the one unicorn in there would transpile to 56034 goats, thus multiplying the score by roughly 11.

Here's the function I used to transpile to Unicorn:



function g(s){return s.replace(/./g,function(c){i=c.charCodeAt();return(i%2?"".repeat(i):"".repeat(i/2))+" "}).slice(0,-1)}
&lt;textarea id=O cols=100&gt;&lt;/textarea&gt;&lt;button id=P onclick="Q.value=g(O.value);R.innerHTML=(Q.value.length+Q.value.split(' ').length-1)/2"&gt;Run&lt;/button&gt;&lt;br&gt;&lt;textarea id=Q rows=10 cols=100&gt;Output appears here.&lt;/textarea&gt;&lt;br&gt;&lt;p&gt;Length: &lt;span id=R&gt;0&lt;/span&gt;&lt;br&gt;&lt;/p&gt;




Note: I haven't actually tested the program, as there isn't an online interpreter that I could find (although I suppose I could hook up the .js file to HTML...?)