How do I create a LAR parser for state machines?

Question

How do I create a LAR parser for state machines?

I want to play with building LR parser generators. Does anyone know of a good (free) resource describing how to create a machine state table from a grammar?

+1

state-machines parser-generator

BCS 21 nov. '08 at 6:53

source to share

4 answers

The best resource I've come across is:

Analysis Methods - A Practical Guide

+1

leppie 21 nov. '08 at 9:17

source to share

The obvious answer is the standard Aho / Ullman / Ravi compiler text, Compiled by: Principles, Methods and Tools

It has full parse chapters. It's not free, but it's worth every penny, and if you're going to build parsers or other compiler-like tools, you're crazy if you don't have this book.

+1

Ira Baxter 03 oct. At 4:38 am

source to share

Maybe you will find Grammatica useful. This is a free Parser generator for .NET. I have some experience with him and it was good. You can try and examine its code. http://grammatica.percederberg.net/

-1

rgargente 21 nov. '08 at 9:47

source to share

Eli bendersky · Accepted Answer · 2008-11-21T06:59:14+0000

For a free resource, consider the Python source code for PLY - the complete implementation of Lex and Yacc in Python.

I would recommend the book, but you can hardly do better than getting The Dragon Book .

How do I create a LAR parser for state machines?

More articles: