{"id":717,"date":"2008-02-18T12:04:39","date_gmt":"2008-02-18T17:04:39","guid":{"rendered":"http:\/\/www.bytebot.net\/blog\/archives\/2008\/02\/18\/an-introduction-to-antlr-sparse-notes"},"modified":"2008-02-18T12:04:42","modified_gmt":"2008-02-18T17:04:42","slug":"an-introduction-to-antlr-sparse-notes","status":"publish","type":"post","link":"http:\/\/www.bytebot.net\/blog\/archives\/2008\/02\/18\/an-introduction-to-antlr-sparse-notes","title":{"rendered":"An introduction to ANTLR (sparse notes)"},"content":{"rendered":"

I attended Clinton Roy’s excellent session titled An introduction to ANTLR: A parser toolkit for problems large and small<\/a>. Now that the slides<\/a>, and the video (1<\/a>, 2<\/a>) are online, I don’t know if my bits of notes are of any use (I made them while the tutorial was in progress), but they’re sitting on my desktop, and really should just get published. The files referenced below, you get via checking out the Antlr Tutorial Preparation<\/a> wiki page.<\/i><\/p>\n

Why use Antlr?<\/b>
To parse configuration files, syntax highlighting, Domain Specific Languages (DSL), interpreters, translation\/transformation.<\/p>\n

Generates easy to follow code, LL(*) parsing algorithm. Bison is more powerful than Antlr. Compined lexer, and parser generator. <\/p>\n

fun (int a, char b); <– as you do LL, till you hit the “;”, you have no idea if you’re dealing with a function or a declaration. Of course, there are look-ahead LL parsers too. An LL3 parser, which can see 3 tokens ahead, you still can’t see ahead enough, till you hit the ;. This is why, there exists an LL(*) – pick the smallest look-ahead, your grammar would need<\/p>\n

Antlr, will help you get rid of using regular expressions.<\/p>\n

Island grammars – one language, inside another (like HTML, inside PHP, or Doxygen inside C) are supported by Antlr.<\/p>\n

Antlr Wiki is good, but hard to find things. Mailing list is great. The book by Terrence Parr is good, but out-dated, so go ahead, and get the online PDF version. A new cookbook\/recipe list is coming out soon.<\/p>\n

Using AntlrWorks<\/a>. java -jar antlrworks.jar<\/p>\n

conffile.g parses a = 1, b = foo.<\/p>\n

IDENT   :       (‘_’|’a’..’z’|’A’..’Z’)(‘_’|’a’..’z’|’A’..’Z’|’0′..’9′)*;
NUMBER  :       ‘0’..’9’+;
WS      :       ‘\\r’ | ‘\\n’ | ‘ ‘ {$channel=HIDDEN;};<\/p>\n

The above are lexer rules. WS = whitespace. It reads from bottom up. White space, a number (0-9). IDENT will match foo, foo, foo1, but not 1foo (identifiers don’t start with numbers).<\/p>\n

{$channel=HIDDEN;} <– IDENTs and NUMBERs get through the channel get through the parse. The whitespace, the parser sees them, but it will ignore them (i.e. hide them).<\/p>\n

[-(byte@hermione)-(pts\/6)-(11:21am:31\/01\/2008)-]
[-(\/tmp\/antlrworks)> l
total 248
drwxrwxr-x  2 byte byte   4096 2008-01-31 11:20 .\/
drwxrwxrwt 44 root root 192512 2008-01-31 11:20 ..\/
-rw-rw-r–  1 byte byte    340 2008-01-31 11:20 conffile__.g
-rw-rw-r–  1 byte byte   8492 2008-01-31 11:20 conffileLexer.java
-rw-rw-r–  1 byte byte   4180 2008-01-31 11:20 conffileParser.java
-rw-rw-r–  1 byte byte     28 2008-01-31 11:20 conffile.tokens<\/p>\n

conffile__.g – lexer file
conffile.tokes – tokens<\/p>\n

CMinus.g takes input, which is a C program. Go to the interpreter, and you can then see the entire parse tree. Very impressive!<\/p>\n

Technorati Tags: lca08<\/a>, antlr<\/a>, antlrworks<\/a><\/p>\n

Share this:<\/h3>