User contributions for Root
10 April 2008
- 11:2311:23, 10 April 2008 diff hist +3,483 Top-Down Parsing/Example 2 →Solution
- 11:1711:17, 10 April 2008 diff hist +5,650 Top-Down Parsing/Example 2 →Solution
- 10:5810:58, 10 April 2008 diff hist +12 Top-Down Parsing/Example 2 No edit summary
- 10:5810:58, 10 April 2008 diff hist +380 Top-Down Parsing/Example 2 No edit summary
- 10:5310:53, 10 April 2008 diff hist +1,205 Top-Down Parsing/Example 2 No edit summary
- 10:4510:45, 10 April 2008 diff hist +637 N Top-Down Parsing/Example 2 New page: == Problem == Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{d,e,f,g,h}</tt>''' is the set of terminal symbols: S -> A B d | C d A -> C d h ...
- 10:2010:20, 10 April 2008 diff hist +18 Top-Down Parsing/Example 1 →Problem
- 10:2010:20, 10 April 2008 diff hist +70 Top-Down Parsing/Example 1 →Problem
- 10:1910:19, 10 April 2008 diff hist +7 Top-Down Parsing/Example 1 →Problem
- 10:1710:17, 10 April 2008 diff hist +10 Top-Down Parsing/Example 1 →Solution
9 April 2008
- 20:1120:11, 9 April 2008 diff hist +4,810 Top-Down Parsing/Example 1 →Solution
- 20:0520:05, 9 April 2008 diff hist +10,787 Top-Down Parsing/Example 1 →Solution
- 19:3319:33, 9 April 2008 diff hist +8,852 Top-Down Parsing/Example 1 No edit summary
- 18:0518:05, 9 April 2008 diff hist +1,806 N Top-Down Parsing/Example 1 New page: == Problem == Consider the following grammar: E -> E + T | E - T | T T -> T * F | T / F | F F -> ( E ) | id # Rewrite the grammar so that it can be analyzed by a predictive parser...
- 17:4317:43, 9 April 2008 diff hist +4 Top-Down Parsing →Step 7: Parsing
- 17:2717:27, 9 April 2008 diff hist +1,921 Top-Down Parsing →Step 7: Parsing
- 17:2317:23, 9 April 2008 diff hist 0 Top-Down Parsing →Step 5: Computing the FIRST and FOLLOW Sets
8 April 2008
- 11:0511:05, 8 April 2008 diff hist −8 Introduction to Syntax/Exercise 1 →The Problem
- 11:0411:04, 8 April 2008 diff hist −2 Introduction to Syntax/Exercise 1 →The Problem
- 11:0311:03, 8 April 2008 diff hist +580 N Introduction to Syntax/Exercise 1 New page: == The Problem == Consider the following grammar: <text> bexpr -> bexpr or bexpr | bterm bterm -> bterm and bterm | bfactor bfactor -> not bfactor | ( bexpr ) | true | false </text>...
- 10:5810:58, 8 April 2008 diff hist +59 Introduction to Syntax No edit summary
- 10:3410:34, 8 April 2008 diff hist +46 Top-Down Parsing No edit summary
- 10:3310:33, 8 April 2008 diff hist +146 Top-Down Parsing →Parsing the Input String
- 10:1210:12, 8 April 2008 diff hist +160 Top-Down Parsing →Step 3: Eliminating Left Recursion
- 10:1010:10, 8 April 2008 diff hist +27 Top-Down Parsing →Step 5: Computing the FIRST and FOLLOW Sets
- 10:0910:09, 8 April 2008 diff hist +27 Top-Down Parsing →Problems
- 10:0810:08, 8 April 2008 diff hist +27 Top-Down Parsing →Parsing Algorithm
6 April 2008
- 16:4116:41, 6 April 2008 diff hist +6 Top-Down Parsing →Step 7: Parsing
- 16:4116:41, 6 April 2008 diff hist +5 Top-Down Parsing →Step 7: Parsing
- 16:3916:39, 6 April 2008 diff hist +6,029 Top-Down Parsing →Step 7: Parsing
- 16:2916:29, 6 April 2008 diff hist +1,258 Top-Down Parsing →Parsing the Input String
- 16:1616:16, 6 April 2008 diff hist +32 Top-Down Parsing No edit summary
- 16:1216:12, 6 April 2008 diff hist −8 Top-Down Parsing →Step 6: The Parse Table
- 16:1216:12, 6 April 2008 diff hist +29 Top-Down Parsing →Step 6: The Parse Table
- 16:0516:05, 6 April 2008 diff hist +2,060 Top-Down Parsing →Building the Parse Table
- 15:1315:13, 6 April 2008 diff hist +676 Introduction to Syntax No edit summary
- 15:0315:03, 6 April 2008 diff hist +1,016 N Introduction to Syntax New page: == Computing the FIRST Set == The FIRST set for a given string or symbol can be computed as follows: # If '''a''' is a terminal symbol, then FIRST('''a''') = {'''a'''} # If X is a non-te...
- 14:3614:36, 6 April 2008 diff hist +3 Top-Down Parsing No edit summary
- 14:0814:08, 6 April 2008 diff hist +42 Top-Down Parsing →LL(1) Parsers
- 14:0314:03, 6 April 2008 diff hist −2 Top-Down Parsing →Step 5: Computing the FIRST and FOLLOW Sets
- 13:4913:49, 6 April 2008 diff hist −8 Top-Down Parsing →Step 5: Computing the FIRST and FOLLOW Sets
- 13:4813:48, 6 April 2008 diff hist +45 Top-Down Parsing →Step 5: Computing the FIRST and FOLLOW Sets
- 13:4713:47, 6 April 2008 diff hist −3 Top-Down Parsing No edit summary
- 13:4613:46, 6 April 2008 diff hist +1,021 Top-Down Parsing →Step 4: Factorization
- 12:4412:44, 6 April 2008 diff hist +321 Top-Down Parsing →Step 4: Factorization
- 12:3912:39, 6 April 2008 diff hist −30 Top-Down Parsing →Step 4: Factorization
- 12:3912:39, 6 April 2008 diff hist +14 Top-Down Parsing →Step 4: Factorization
- 12:3812:38, 6 April 2008 diff hist +586 Top-Down Parsing →Step 3: Eliminating Left Recursion
- 12:3212:32, 6 April 2008 diff hist +391 Top-Down Parsing →Step 3: Eliminating Left Recursion
- 12:2712:27, 6 April 2008 diff hist −91 Top-Down Parsing →Step 2: Eliminating the Left Corner