Special

User contributions for Root

Results for Root talk block log uploads logs
A user with 15,442 edits.

09:0909:09, 16 April 2008 diff hist +68 N The YACC Parser Generator New page: == Basic Concepts == * Definitions * Rules, semantic actions * Code
09:0809:08, 16 April 2008 diff hist +13 The Flex Lexical Analyzer No edit summary
09:0809:08, 16 April 2008 diff hist +89 Tópicos sobre Construção de Compiladores No edit summary

20:5720:57, 11 April 2008 diff hist +7,774 Top-Down Parsing/Example 3 →Solution
20:5620:56, 11 April 2008 diff hist +15,791 Top-Down Parsing/Example 3 →Solution
20:4320:43, 11 April 2008 diff hist +218 Top-Down Parsing/Example 3 →Solution
20:3620:36, 11 April 2008 diff hist −454 Top-Down Parsing/Example 3 →Solution
20:0620:06, 11 April 2008 diff hist +2 Top-Down Parsing/Example 3 →Solution
16:5516:55, 11 April 2008 diff hist −50 Top-Down Parsing/Example 3 →Solution
16:5216:52, 11 April 2008 diff hist +549 Top-Down Parsing/Example 3 →Solution
16:2816:28, 11 April 2008 diff hist +1 Top-Down Parsing →Problems
14:5614:56, 11 April 2008 diff hist +4 Top-Down Parsing/Example 3 →Solution
14:5314:53, 11 April 2008 diff hist +6 Top-Down Parsing/Example 3 →Solution
14:5314:53, 11 April 2008 diff hist +375 Top-Down Parsing/Example 3 No edit summary
14:4314:43, 11 April 2008 diff hist +930 Top-Down Parsing/Example 3 No edit summary
14:2214:22, 11 April 2008 diff hist +633 N Top-Down Parsing/Example 3 New page: == Problem == Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{u,v,x,y,z}</tt>''' is the set of terminal symbols: S -> u B z B -> B v | D D ...
14:1514:15, 11 April 2008 diff hist +1,656 Top-Down Parsing/Example 2 →Solution
11:4811:48, 11 April 2008 diff hist +203 Introduction to Syntax/Exercise 1 No edit summary

11:2311:23, 10 April 2008 diff hist +1 Top-Down Parsing/Example 2 →Solution
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

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

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

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

Retrieved from "https://robots.hlt.inesc-id.pt/w/pt/index.php/Special:Contributions/Root"