How to transform a production to LL(1) grammar for a list separated by a semicolon?
- by Subb
Hi,
I'm reading this introductory book on parsing (which is pretty good btw) and one of the exercice is to "build a parser for your favorite language." Since I don't want to die today, I thought I could do a parser for something relatively simple, ie a simplified CSS.
Note: This book teach you how to right a LL(1) parser using the recursive-descent algorithm.
So, as a sub-exercice, I am building the grammar from what I know of CSS. But I'm stuck on a production that I can't transform in LL(1) :
//EBNF
block = "{", declaration, {";", declaration}, [";"], "}"
//BNF
<block> =:: "{" <declaration> "}"
<declaration> =:: <single-declaration> <opt-end> | <single-declaration> ";" <declaration>
<opt-end> =:: "" | ";"
This describe a CSS block. Valid block can have the form :
{ property : value }
{ property : value; }
{ property : value; property : value }
{ property : value; property : value; }
...
The problem is with the optional ";" at the end, because it overlap with the starting character of {";", declaration}, so when my parser meet a semicolon in this context, it doesn't know what to do.
The book talk about this problem, but in its example, the semicolon is obligatory, so the rule can be modified like this :
block = "{", declaration, ";", {declaration, ";"}, "}"
So, Is it possible to achieve what I'm trying to do using a LL(1) parser?
