PLC Laboratory 3 - Revision history

Beh01: /* Computing sets FIRST and FOLLOW */

2023-03-07T08:46:00Z

Computing sets FIRST and FOLLOW

2022-01-27T08:07:13Z

2022-01-26T10:38:57Z

Computing sets FIRST and FOLLOW

2022-01-26T09:49:21Z

2022-01-26T09:45:43Z

2022-01-26T09:45:25Z

2022-01-26T09:44:59Z

Computing sets FIRST and FOLLOW

2022-01-26T09:39:13Z

2022-01-26T09:34:13Z

2022-01-26T09:33:27Z

@@ Line 9: / Line 9: @@
 === Additional guidelines ===
 * As a first step, you can compute which non-terminals can be rewritten as an empty word.
-* Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://www.cs.vsb.cz/behalek/vyuka/pjp/cviceni/uloha4/reseni_popis.html Here (only in Czech)]
+* Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://behalek.cs.vsb.cz/vyuka/pjp/cviceni/uloha4/reseni_popis.html Here (only in Czech)]
 == Input specification ==

@@ Line 5: / Line 5: @@
 To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.
 * [http://linedu.vsb.cz/~beh01/wiki_data/PLC_lab3_Java.zip Java] - Netbeans 12.6 project
-* [http://linedu.vsb.cz/~beh01/wiki_data/PLC_lab3_Java.zip C#] - VS2022 project
+* [http://linedu.vsb.cz/~beh01/wiki_data/PLC_lab3_csharp.zip C#] - VS2022 project
 === Additional guidelines ===

← Older revision		Revision as of 10:38, 26 January 2022
Line 4:		Line 4:

	To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.		To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.
		+	* [http://linedu.vsb.cz/~beh01/wiki_data/PLC_lab3_Java.zip Java] - Netbeans 12.6 project
		+	* [http://linedu.vsb.cz/~beh01/wiki_data/PLC_lab3_Java.zip C#] - VS2022 project

	=== Additional guidelines ===		=== Additional guidelines ===

@@ Line 5: / Line 5: @@
 To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.
-''Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://www.cs.vsb.cz/behalek/vyuka/pjp/cviceni/uloha4/reseni_popis.html Here (only in czech)]''
+=== Additional guidelines ===
 == Input specification ==
@@ Line 19: / Line 21: @@
 For the context free grammar from the input write FIRST sets for the right-hand side of all its rules. Next write computed FOLLOW sets for all grammar non-terminals.
-Output’s formatting is not strict, your output should be similar to the output from the example.
+Output’s formatting is not strict, your output should be like the output from the example.
 == Example ==

@@ Line 5: / Line 5: @@
 To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.
-''Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://www.cs.vsb.cz/behalek/vyuka/pjp/cviceni/uloha4/reseni_popis.html Guide (only in czech)]''
+''Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://www.cs.vsb.cz/behalek/vyuka/pjp/cviceni/uloha4/reseni_popis.html Here (only in czech)]''
 == Input specification ==

← Older revision		Revision as of 09:44, 26 January 2022
Line 4:		Line 4:

	To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.		To simplify the solution, you can use prepared grammar readers (they are prepared for Java and C#). They both read a context grammar from the input and represents it as an object.
		+
		+	Informal description, how to compute FIRST and FOLLOW in implementation friendly way is [http://www.cs.vsb.cz/behalek/vyuka/pjp/cviceni/uloha4/reseni_popis.html Guide (only in czech)]

	== Input specification ==		== Input specification ==

@@ Line 15: / Line 15: @@
 == Output specification ==
-For each expression write one line containing the result – the computed value of the expression. If there is any error in the input, write text <code>ERROR</code> instead.
+For the context free grammar from the input write FIRST sets for the right-hand side of all its rules. Next write computed FOLLOW sets for all grammar non-terminals.
 == Example ==

@@ Line 27: / Line 27: @@
 * Output
-Your output can be different, based on your representation of epsilon and the ''end of input'' character.
+Your output can be different, based on your representation of epsilon and the ''end of input'' character. Also a formatting depends on you.
 <syntaxhighlight lang="haskell" >
 first[A:bC] = b

@@ Line 29: / Line 29: @@
 Your output can be different, based on your representation of epsilon and the ''end of input'' character.
 <syntaxhighlight lang="haskell" >
-first[bC] = b
+first[A:bC] = b
-first[Bd] = b c d
+first[A:Bd] = b c d
-first[CC] = c {e}
+first[B:CC] = c {e}
-first[bA] = b
+first[B:bA] = b
-first[cC] = c
+first[C:cC] = c
-first[{e}] = {e}
+first[C:{e}] = {e}
 follow[A] = d $
 follow[B] = d
 follow[C] = c d $
 </syntaxhighlight >