<html>
<head>
<meta content="text/html; charset=windows-1252"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
Do you know about CoCo/R by <span class="st"><em>Hanspeter</em>
Mössenböck?<br>
CoCo/R => Compiler Compiler with recursive descent.<br>
It checks for LL(1) in the .atg (attributed grammar) file.<br>
</span><br>
-Doug Danforth<br>
<br>
<div class="moz-cite-prefix">On 7/17/2016 6:52 PM, Srinivas Nayak
wrote:<br>
</div>
<blockquote cite="mid:578C3661.9000606@gmail.com" type="cite">Dear
All,
<br>
<br>
Lets say I want to modify Oberon language.
<br>
I would then like to check if my modified language is LL(1).
<br>
Towards that end, I would also like to calculate First and
<br>
Follow set of symbols for each of my non-terminals.
<br>
<br>
I see a nice program EBNF.Mod
<br>
How can I modify this program to
<br>
1. calculate First and Follow set of symbols for each of my
non-terminals.
<br>
2. check if my language is LL(1)
<br>
<br>
<br>
<br>
With thanks and best regards,
<br>
<br>
Yours sincerely,
<br>
Srinivas Nayak
<br>
<br>
Home: <a class="moz-txt-link-freetext" href="http://www.mathmeth.com/sn/">http://www.mathmeth.com/sn/</a>
<br>
Blog: <a class="moz-txt-link-freetext" href="http://srinivas-nayak.blogspot.in/">http://srinivas-nayak.blogspot.in/</a>
<br>
--
<br>
<a class="moz-txt-link-abbreviated" href="mailto:Oberon@lists.inf.ethz.ch">Oberon@lists.inf.ethz.ch</a> mailing list for ETH Oberon and related
systems
<br>
<a class="moz-txt-link-freetext" href="https://lists.inf.ethz.ch/mailman/listinfo/oberon">https://lists.inf.ethz.ch/mailman/listinfo/oberon</a>
<br>
<br>
</blockquote>
<br>
</body>
</html>