User contributions for Root

28 May 2013

• 17:2117:21, 28 May 2013 diff hist +47 Code Generation/Exercise 9 →Function "compute"
• 17:2017:20, 28 May 2013 diff hist +47 Code Generation/Exercise 9 →Function "mkvec"

13 May 2013

• 16:2016:20, 13 May 2013 diff hist −8 Manual da RTS →Funções
• 16:1916:19, 13 May 2013 diff hist +4 Manual da RTS →Funções
• 15:2215:22, 13 May 2013 diff hist −111 Code Generation No edit summary
• 15:2215:22, 13 May 2013 diff hist −112 Code Generation/Duplication of Floating Point Numbers on the Stack No edit summary
• 15:2115:21, 13 May 2013 diff hist +1 Code Generation/Duplication of Floating Point Numbers on the Stack No edit summary
• 15:2015:20, 13 May 2013 diff hist −7 Code Generation/Duplication of Floating Point Numbers on the Stack No edit summary
• 15:1515:15, 13 May 2013 diff hist +30 Code Generation/Exercise 7 →Postfix Code

7 May 2013

• 10:2310:23, 7 May 2013 diff hist +3 Code Generation/Example 4 →Postfix Code

2 May 2013

• 10:0010:00, 2 May 2013 diff hist +115 Code Generation →Examples
• 09:5909:59, 2 May 2013 diff hist +112 Code Generation/Duplication of Floating Point Numbers on the Stack No edit summary
• 09:5809:58, 2 May 2013 diff hist 0 Code Generation →Examples
• 09:5709:57, 2 May 2013 diff hist 0 Code Generation/Example 3 →Postfix Code

22 April 2013

• 17:3917:39, 22 April 2013 diff hist +3 Bottom-Up Parsing/Example 5: LALR(1) →Solution
• 17:3917:39, 22 April 2013 diff hist +64 Bottom-Up Parsing/Example 5: LALR(1) →Solution

11 April 2013

• 09:2509:25, 11 April 2013 diff hist +2 Quick topics on compiling and linking in C/C++ →Creating the library
• 09:2509:25, 11 April 2013 diff hist +1,818 Quick topics on compiling and linking in C/C++ →Second Scenario: Using Static Libraries

8 April 2013

• 19:2819:28, 8 April 2013 diff hist −99 Theoretical Aspects of Lexical Analysis/Exercise 18 No edit summary
• 19:1319:13, 8 April 2013 diff hist +15,044 N Theoretical Aspects of Lexical Analysis/Exercise 18 Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = {..."
• 18:5418:54, 8 April 2013 diff hist +136 Theoretical Aspects of Lexical Analysis →Exercises
• 18:5318:53, 8 April 2013 diff hist +1,844 Top-Down Parsing/Exercise 10: Test 2013/04/03 →Solution
• 18:2718:27, 8 April 2013 diff hist −2 Top-Down Parsing/Exercise 10: Test 2013/04/03 No edit summary
• 18:2618:26, 8 April 2013 diff hist +6 Top-Down Parsing/Exercise 10: Test 2013/04/03 →Problem
• 18:2618:26, 8 April 2013 diff hist +688 N Top-Down Parsing/Exercise 10: Test 2013/04/03 Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols: S → M y S ..."
• 18:2418:24, 8 April 2013 diff hist +81 Top-Down Parsing →Exercises

29 March 2013

• 20:5420:54, 29 March 2013 diff hist 0 Top-Down Parsing/Exercise 7 →Solution
• 20:5320:53, 29 March 2013 diff hist 0 Top-Down Parsing/Exercise 9 →Solution
• 20:5320:53, 29 March 2013 diff hist +6 Top-Down Parsing/Exercise 9 →Solution
• 20:4920:49, 29 March 2013 diff hist −6 Top-Down Parsing/Exercise 9 →Solution
• 20:4720:47, 29 March 2013 diff hist +2 Top-Down Parsing/Exercise 9 →Solution
• 20:4720:47, 29 March 2013 diff hist +4 Top-Down Parsing/Exercise 9 →Solution
• 20:4520:45, 29 March 2013 diff hist 0 N File:CompilersTopDownParsingExercise9.jpg No edit summary current
• 20:3020:30, 29 March 2013 diff hist +678 N Top-Down Parsing/Exercise 9 Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols: C -> v A ->..."
• 20:2820:28, 29 March 2013 diff hist +45 Top-Down Parsing →Exercises
• 20:1320:13, 29 March 2013 diff hist 0 Top-Down Parsing/Exercise 7 →Solution
• 20:0820:08, 29 March 2013 diff hist +6 Top-Down Parsing/Exercise 7 →Solution
• 19:5319:53, 29 March 2013 diff hist 0 N File:CompilersTopDownParsingExercise7.jpg No edit summary current
• 19:5219:52, 29 March 2013 diff hist +48 Top-Down Parsing/Exercise 7 →Solution

21 March 2013

• 17:1417:14, 21 March 2013 diff hist +9 Composite (padrão de desenho)/Exemplo 1: Empregada de Restaurante →A Empregada Básica
• 17:1317:13, 21 March 2013 diff hist −845 Composite (padrão de desenho)/Exemplo 1: Empregada de Restaurante →A Empregada Básica

10 March 2013

• 17:2617:26, 10 March 2013 diff hist +11,618 N Theoretical Aspects of Lexical Analysis/Exercise 17 Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = {..."
• 17:2317:23, 10 March 2013 diff hist +2 Theoretical Aspects of Lexical Analysis →Exercises
• 17:2317:23, 10 March 2013 diff hist +131 Theoretical Aspects of Lexical Analysis →Exercises

5 February 2013

• 17:3617:36, 5 February 2013 diff hist 0 File:PO-20130204t1-class.png uploaded a new version of "File:PO-20130204t1-class.png" current
• 17:3517:35, 5 February 2013 diff hist 0 File:PO-20130204t1-class.png uploaded a new version of "File:PO-20130204t1-class.png"
• 17:3317:33, 5 February 2013 diff hist 0 N File:PO-20130204t1-class.png No edit summary
• 13:4213:42, 5 February 2013 diff hist −1 Programação com Objectos →Exercícios e Problemas
• 13:4113:41, 5 February 2013 diff hist −4 Programação com Objectos →Exercícios e Problemas
• 13:4113:41, 5 February 2013 diff hist −2 Programação com Objectos →Exercícios e Problemas