Five implementations -- JavaScript, Typescript, C++, Elisp, and Perl -- of the name generator described at RinkWorks. The Typescript and C++ implementations are by far the most mature.
The JavaScript version uses an optimizing template-compiler to create an efficient generator object.
var generator = NameGen.compile("sV'i");
generator.toString(); // => "entheu'loaf"
generator.toString(); // => "honi'munch"
The Typescript version is based on the C++ version.
import NameGen from "./utils/namegen";
let generator = new NameGen.Generator("sV'i");
generator.toString(); // => "entheu'loaf"
generator.toString(); // => "honi'munch"
The C++ version also uses a template-compiler (based on the one for JavaScript) to create an efficient generator object. It requires C++11.
NameGen::Generator generator("sV'i");
generator.toString(); // => "drai'sneeze"
generator.toString(); // => "ardou'bumble"
The C version generates names directly from the template in a single pass:
char name[64];
unsigned long seed = 0xb9584b61UL;
namegen(name, sizeof(name), "sV'i", &seed);
This is the fastest implementation.
The Emacs Lisp version doesn't include a parser. It operates on s-expressions.
(fset 'generator (apply-partially #'namegen '(s V "'" i)))
(generator) ; => "essei'knocker"
(generator) ; => "tiaoe'nit"
The Perl version is exceptionally slow, due to a slow parser.
generate("sV'i"); # => "echoi'bum"
This is the slowest implementation.