Hi all,<div><br></div><div>I am new to Haskell, I need to write a grammar hacker in Haskell; that would find the first set of grammar, follow set of grammar, determine if it is in LL or not and generate a LR table. Can someone help me with the same? </div>


<div><br></div><div>Any reply would be much appreciated. </div><div><br></div><div><br></div><div><div><br><div><br></div><br>
</div></div>
<br clear="all"><br>-- <br><div><br></div>Sharadha Raghunathan<div><br></div><br>