Author Archives: kay

Java Spring – or the Biggus Dickus effect

Looking at the API alone Spring feels like reading a parody on Java enterprise software written by Steve Yegge. AbstractBeanFactoryBasedTargetSourceCreator ContextSingletonBeanFactoryLocator AspectJAdviceParameterNameDiscoverer UserRoleAuthorizationInterceptor TransactionAwarePersistenceManagerFactoryProxy SQLStateSQLExceptionTranslator SimpleBeanFactoryAwareAspectInstanceFactory … Legend! Nonstop administrative debris as dadaist poetry. Écriture automatique of the programming office … Continue reading

Posted in Java | 31 Comments

Jynx

I have just released the initial version of my new Jython project Jynx on Google Code. Jynx sums up my latest efforts on the dynamic Java compilation front and it heads into the future of Java framework utilization from Python. … Continue reading

Posted in Jynx, Jython | Comments Off on Jynx

Stitches of a flea language – defining Java annotations in Jython

Jython annotations – anyone? The last few days I tried to figure out how to create Jython annotations. A Jython annotation is defined here as a Java annotation lifted from Jython to Java. So one essentially defines a Java annotation … Continue reading

Posted in Java, Jython | 9 Comments

Into The Labyrinth – using the JavaCompiler API from Jython

The Plumber After having neglected Java for years I began to re-examine it this month together with Jython and my initial reaction was a culture shock. Java is infamous for being a “plumbing language” i.e. you have to subclass some … Continue reading

Posted in Java, Python | 1 Comment

Linear bounds for backtracking parsers with memoization

On the comp.compilers mailing list I asked for a confirmation of the O(n) complexity claim for packrat parsers. A packrat parser is a particular top down recursive descendant parser which applies backtracking on failure of consuming a token by application … Continue reading

Posted in Parsing | 2 Comments

Is parsing Perl really impossible?

I just read this article about the apparent inability to parse Perl 5. There is an underlying assumption that a parser has to resolve all ambiguities and derive a single parse tree from an expression ( giving a unique interpretation … Continue reading

Posted in Grammars, Parsing | 5 Comments

Jython – 64K ought to be enough for anybody

Jython 2.5rc4 (Release_2_5rc4:6470, Jun 8 2009, 13:23:16) [Java HotSpot(TM) Client VM (Sun Microsystems Inc.)] on java1.6.0_13 Type "help", "copyright", "credits" or "license" for more information. >>> L = range(10000) >>> eval(str(L)) Traceback (most recent call last): File "", line 1, … Continue reading

Posted in General | 9 Comments

CodeTemplates – a fresh look on code transformations

This is the first part of a two part article series about CodeTemplates. CodeTemplates are a code transformation technique that suggests an alternative to common syntactic as well as lexical macros for whole language transformations. Syntactic macros About three years … Continue reading

Posted in DSL, Grammars, TBP | Comments Off on CodeTemplates – a fresh look on code transformations

Singular irregularities

An irregularity is a shape or rule violation. It supposes that objects are built according to rules but there are exceptional cases that don’t really fit or do at least violate our expectations of the building law. An irregularity is … Continue reading

Posted in General | 3 Comments

VHDL grammars and the parser sandwich

Eli Bendersky has mentioned some problems of parsing VHDL. I was quite pleased though finding the Postlexer idea being discussed in the following paper which provides a more thorough treatment of VHDL parsing issues. They call it “Auxiliary Terminal Generator” … Continue reading

Posted in Grammars | 4 Comments