Top-Down Parsing/Exercise 5: Test 2010/07/01: Revision history

5 December 2018

• curprev 22:2022:20, 5 December 2018‎ Root talk contribs‎ 62 bytes −2,652‎ Redirected page to ist:Top-Down Parsing/Exercise 5: Test 2010/07/01

6 April 2015

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

2 July 2010

• curprev 10:3410:34, 2 July 2010‎ Root talk contribs‎ 2,714 bytes −528‎ →‎Parse Table
• curprev 10:2610:26, 2 July 2010‎ Root talk contribs‎ 3,242 bytes −3‎ →‎Computing the FIRST and FOLLOW Sets

1 July 2010

• curprev 19:0119:01, 1 July 2010‎ Root talk contribs‎ 3,245 bytes +3,245‎ New page: {{TOCright}} = Problem = Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{t,u,v,w,x}</tt>''' is the set of terminal symbols: A -> B D B -> C w B...