| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

Textbook for "QM as complex probabilities"; SFO Get Libor Trader (14 years); Why Are There Still So Many Jobs?; Navier Stokes Incomplete; More on Benford; FBI Claimed Vandalism; Architectural Tessellation; Also: Go, Blake's 7; Delusions of Gender (book); Crypto AG DID work with NSA / GCHQ; UNUMS (Universal Number Format); MOOCs (Massive Open Online Courses); Interesting Looking Game; Euler's Theorem for Polynomials; Weeks 3-6; Reddit Comment; Differential Cryptanalysis For Dummies; Japanese Graphic Design; Books To Be Re-Read; And Today I Learned Bugs Need Clear Examples; Factoring a 67 bit prime in your head; Islamic Geometric Art; Useful Julia Backtraces from Tasks; Nothing, however, is lost with less discomfort than that which, when lost, cannot be missed; Article on Didion; Cost of Living by City; British Slavery; Derrida on Metaphor; African SciFi; Traits in Julia; Alternative Japanese Lit; Pulic Key as Address (Snow); Why Information Grows; The Blindness Of The Chilean Elite; Some Victoriagate Links; This Is Why I Left StackOverflow; New TLS Implementation; Maths for Physicists; How I Am 8; 1000 Word Philosophy; Cyberpunk Reading List; Detailed Discussion of Message Dispatch in ParserCombinator Library for Julia; FizzBuzz in Julia w Dependent Types; kokko - Design Shop in Osaka; Summary of Greece, Currently; LLVM and GPUs; See Also; Schoolgirl Groyps (Maths); Japanese Lit; Another Example - Modular Arithmetic; Music from United; Python 2 and 3 compatible alternative.; Read Agatha Christie for the Plot; A Constructive Look at TempleOS; Music Thread w Many Recommendations; Fixed Version; A Useful Julia Macro To Define Equality And Hash; k3b cdrom access, OpenSuse 13.1; Week 2; From outside, the UK looks less than stellar; Huge Fonts in VirtualBox; Keen - Complex Emergencies; The Fallen of World War II; Some Spanish Fiction; Calling C From Fortran 95; Bjork DJ Set; Z3 Example With Python; Week 1; Useful Guide To Starting With IJulia; UK Election + Media; Review: Reinventing Organizations; Inline Assembly With Julia / LLVM; Against the definition of types; Dumb Crypto Paper; The Search For Quasi-Periodicity...; Is There An Alternative To Processing?; CARDIAC (CARDboard Illustrative Aid to Computation); The Bolivian Case Against Chile At The Hague; Clear, Cogent Economic Arguments For Immigration; A Program To Say If I Am Working; Decent Cards For Ill People; New Photo; Luksic And Barrick Gold; President Bachelet's Speech; Baltimore Primer; libxml2 Parsing Stream; configure.ac Recipe For Library Path; The Davalos Affair For Idiots; Not The Onion: Google Fireside Chat w Kissinger; Bicycle Wheels, Inertia, and Energy; Another Tax Fraud; Google's Borg; A Verion That Redirects To Local HTTP Server; Spanish Accents For Idiots; Aluminium Cans; Advice on Spray Painting; Female View of Online Chat From a Male; UX Reading List; S4 Subgroups - Geometric Interpretation; Fucking Email; The SQM Affair For Idiots

© 2006-2015 Andrew Cooke (site) / post authors (content).

Good Hacks, Bad Hacks - Experiences with DSLs in Java

From: "andrew cooke" <andrew@...>

Date: Wed, 28 Jun 2006 10:05:29 -0400 (CLT)

Some simple observations / notes / reflections.

Implementing a system to load a set of database tables with data, I used a
DSL to specify the relationship between the tables (key relations) and the
data source.

I separated the language into two stages.  In the first stage you could
only define types (table structures).  The second stage extended the
first, allowing the full set of features.

That seemed a bit odd, and the implementation was rather ugly, but still
turned out to be a good idea.  The goodneess came from the possibility of
generating the first stage from the database (via postgres's "meta"
tables).

Having this information as a simple AST allowed us to combine (incomplete)
database meta-information with extra user-added text (by merging ASTs). 
That may not be clear - I am talking about the first stage only.  We could
both generate the description from the database and via text files.  The
two were complementary.

Extra checks in the second stage guaranteed that all referenced tables
were fully defined (ie non "not null" values were missing).  This check
cannot be made on the first stage because that includes all tables (even
those nto populated by this particular invocation).  In otehr words, the
first stage defines the database; the second stage selects some tables
from that for populating.

However, there were also some bad points.  First, what is the relationship
(implementation-wise) between the two stages?  I had them sharing common
base classes and copying data across (so when a table is references in the
second stage for the first time, all data from the first stage is copied
across).

It would have been better for the second stage to include a reference to
the first stage ("has a", rather than a bastardised "is a").

Another bad point was the syntax.  I argued that I didn't have time to
write a parser, and came up with what seemed like an elegant hack -
http://www.acooke.org/cute/UsefulJava0.html - which gave me the parse tree
directly (note that the language is declarative, so order of statements is
unimportant).

However, this has confused users, since the lhs of the syntax is a set of
arbitrary names to label branches in the AST and therefore has no direct
connection between the two stages.

At the same time, in another part of the system, I wrote (in less time
than the hack above, I suspect) a very simple "lazy scheme" (without,
currently, function defn / lambda abstraction, continuations, macros, or
most standard functions) (laziness allows "everything" to be a function). 
We could have used that here.

One other regret - I should have been clearer about the DSL approach. 
I've written enough language-related code to have absorbed many of the
patterns, which led to using them without a clear high-level description
(I had a design/sketch for how things would work, but not a simple,
unifying "vision").  Just thinking of the system "as a language" would
have helped clarify things, I believe.  Certainly it would have made it
easier to explain to others later (the current system, with no real
language to speak of - just this "parse trees as properties" - looks like
a monolith with arbitrarily complex configuration values, rather than an
interpreter).

Andrew

Comment on this post