From: | Lieven Marchand <mal@wyrd.be> |
Newsgroups: | comp.compilers |
Date: | Sat, 09 Jun 2012 17:24:19 +0200 |
Organization: | Compilers Central |
References: | 12-03-012 12-03-014 12-06-008 12-06-012 12-06-015 |
Keywords: | history |
Posted-Date: | 11 Jun 2012 02:06:55 EDT |
Johann 'Myrkraverk' Oskarsson <johann@2ndquadrant.com> writes:
> Can you make anything simpler if you add Latin grammar rules to your
> language?
I would say the Lingua::Romana::Perligata [0] experiment supports answering
this one in the negative.
Try to guess the algorithm implemented here:
#! /usr/local/bin/perl -w
use Lingua::Romana::Perligata;
maximum inquementum tum biguttam egresso scribe.
meo maximo vestibulo perlegamentum da.
da duo tum maximum conscribementa meis listis.
dum listis decapitamentum damentum nexto
fac sic
nextum tum novumversum scribe egresso.
lista sic hoc recidementum nextum cis vannementa da listis.
cis.
[0] http://www.csse.monash.edu.au/~damian/papers/HTML/Perligata.html
Return to the
comp.compilers page.
Search the
comp.compilers archives again.