Top-Down Parsing/Exercise 4: Test 2010/04/17: Revision history

5 December 2018

• curprev 22:1922:19, 5 December 2018‎ Root talk contribs‎ 62 bytes −3,484‎ Redirected page to ist:Top-Down Parsing/Exercise 4: Test 2010/04/17

6 April 2015

• curprev 14:4114:41, 6 April 2015‎ Root talk contribs‎ 3,546 bytes 0‎ No edit summary

21 March 2011

• curprev 22:4622:46, 21 March 2011‎ Root talk contribs‎ 3,546 bytes 0‎ →‎Parse Table
• curprev 22:4522:45, 21 March 2011‎ Root talk contribs‎ 3,546 bytes +3‎ →‎Computing the FIRST and FOLLOW Sets
• curprev 22:1722:17, 21 March 2011‎ Root talk contribs‎ 3,543 bytes 0‎ →‎Parse Table
• curprev 22:1522:15, 21 March 2011‎ Root talk contribs‎ 3,543 bytes 0‎ →‎Parse Table
• curprev 22:1122:11, 21 March 2011‎ Root talk contribs‎ 3,543 bytes +5‎ →‎Computing the FIRST and FOLLOW Sets

24 April 2010

• curprev 19:3319:33, 24 April 2010‎ Root talk contribs‎ 3,538 bytes +14‎ →‎FIRST and FOLLOW Sets
• curprev 19:3319:33, 24 April 2010‎ Root talk contribs‎ 3,524 bytes +3,524‎ New page: {{TOCright}} = Problem = Consider the following grammar, where '''<tt>B</tt>''' is the initial symbol and '''<tt>{w,x,y,z}</tt>''' is the set of terminal symbols: A -> y B -> B x C | C...