Category Archives: Gazelle

The grammars Gazelle can handle

I wanted to follow-up a bit more on my recent posts about the grammars Gazelle and competing parsing frameworks can handle. Here is an Euler diagram showing my current understanding of what grammars Gazelle can handle compared with the well-known … Continue reading

Posted in Gazelle | Leave a comment

A partial retraction to my last entry

From a theoretical standpoint, my last entry was incorrect when I said that my new algorithm in Gazelle can decide whether a grammar is strong-LL(k) or strong-LL(*). I had proofs against me — these problems have actually been proven undecidable. … Continue reading

Posted in Gazelle | 1 Comment

Gazelle is (at least briefly) the most powerful top-down parser generator there is

On Wednesday when I was sitting at home waiting for the cable guy, I thought very hard about top-down (LL) parsing and lookahead generation. After a few hours of thinking I had an epiphany where I very rapidly discovered several … Continue reading

Posted in Gazelle | 6 Comments

Why Gazelle Matters, part 2

Every day when I read the programming reddit, I see things that reaffirm to me why Gazelle matters. Yesterday it was an “ask reddit”: Need a C library for parsing C files, suggestions?. Responses include: “How about gcc?”, clearly not … Continue reading

Posted in Gazelle | 2 Comments

Gazelle v0.2 is here!

It’s been a long time coming, but Gazelle v0.2 is finally here! The download link is on the Gazelle webpage. Read about what’s changed in the Release Notes. Read the latest version of the manual online, which has a “tour” … Continue reading

Posted in Gazelle | Leave a comment