Special

User contributions for Root

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

15:1515:15, 18 April 2009 diff hist +2,445 Attribute Grammars/Exercise 2: Numbers No edit summary
15:1415:14, 18 April 2009 diff hist +775 N Attribute Grammars/Exercise 2: Numbers New page: Considere a seguinte gramática atributiva: s -> symbol 1 # symbol 2 { s. val = symbol 1. val + symbol 2. val symbol 1. x = 1 symbol 2. x = 1 ...
15:1415:14, 18 April 2009 diff hist +1,214 N Attribute Grammars/Exercise 1: Traffic Light New page: <p><span lang="pt">Pretende-se controlar um semáforo de 3 estados: Encarnado, Amarelo e Verde, representados pelos valores numéricos 2, 1 e 0, respectivamente.</span></p> <p>...
15:1215:12, 18 April 2009 diff hist +225 Attribute Grammars No edit summary

17:4717:47, 6 April 2009 diff hist +18 Top-Down Parsing →Step 1: Eliminating Mutual Recursion
17:2717:27, 6 April 2009 diff hist +60 Top-Down Parsing/Example 1 →Solution

13:2013:20, 30 March 2009 diff hist 0 Theoretical Aspects of Lexical Analysis →Exercises
13:1213:12, 30 March 2009 diff hist +10,917 N Theoretical Aspects of Lexical Analysis/Exercise 12 New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...
11:1411:14, 30 March 2009 diff hist −4 Theoretical Aspects of Lexical Analysis →Exercises
11:1311:13, 30 March 2009 diff hist +405 Theoretical Aspects of Lexical Analysis →Exercises
09:1509:15, 30 March 2009 diff hist +7 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Unpacking the Goods
09:1409:14, 30 March 2009 diff hist +242 Quick-and-Dirty Guide to Transforming Compact into your Compiler No edit summary
09:1209:12, 30 March 2009 diff hist +74 Quick-and-Dirty Guide to Transforming Compact into your Compiler No edit summary

22:1022:10, 29 March 2009 diff hist +6 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
22:0922:09, 29 March 2009 diff hist +10 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
22:0822:08, 29 March 2009 diff hist +4 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
22:0722:07, 29 March 2009 diff hist −15 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
22:0522:05, 29 March 2009 diff hist +7 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Unpacking the Goods
22:0422:04, 29 March 2009 diff hist +30 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
22:0022:00, 29 March 2009 diff hist +61 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
21:5921:59, 29 March 2009 diff hist −1 Quick-and-Dirty Guide to Transforming Compact into your Compiler →Compact
21:5821:58, 29 March 2009 diff hist +7 Quick-and-Dirty Guide to Transforming Compact into your Compiler No edit summary
21:5821:58, 29 March 2009 diff hist +4,764 N Quick-and-Dirty Guide to Transforming Compact into your Compiler New page: Compact is a '''very''' simple compiler. Nevertheless, it already incorporates all major components in a compiler (except for type validation). The following is a quick guide to start you...
21:0621:06, 29 March 2009 diff hist +95 Compiladores No edit summary
17:3117:31, 29 March 2009 diff hist −1 m Theoretical Aspects of Lexical Analysis/Exercise 9 →Input Analysis
17:3117:31, 29 March 2009 diff hist +11,581 N Theoretical Aspects of Lexical Analysis/Exercise 9 New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...
15:1215:12, 29 March 2009 diff hist −842 Theoretical Aspects of Lexical Analysis/Exercise 10 No edit summary
12:1612:16, 29 March 2009 diff hist 0 Theoretical Aspects of Lexical Analysis/Exercise 10 No edit summary
12:1612:16, 29 March 2009 diff hist +10,956 N Theoretical Aspects of Lexical Analysis/Exercise 10 New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...

20:4320:43, 28 March 2009 diff hist +10,963 N Theoretical Aspects of Lexical Analysis/Exercise 8 New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...
17:4017:40, 28 March 2009 diff hist +30 Theoretical Aspects of Lexical Analysis/Exercise 6 No edit summary
17:3817:38, 28 March 2009 diff hist +724 Theoretical Aspects of Lexical Analysis/Exercise 7 No edit summary
16:4516:45, 28 March 2009 diff hist +10,305 N Theoretical Aspects of Lexical Analysis/Exercise 7 New page: __NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. I...
11:2711:27, 28 March 2009 diff hist +12 N MediaWiki:About New page: Informação current
11:2611:26, 28 March 2009 diff hist +4 Theoretical Aspects of Lexical Analysis →Exercises
11:2511:25, 28 March 2009 diff hist +64 Theoretical Aspects of Lexical Analysis →Exercises
11:2411:24, 28 March 2009 diff hist +301 Theoretical Aspects of Lexical Analysis →Exercises
11:2111:21, 28 March 2009 diff hist +357 Theoretical Aspects of Lexical Analysis →Exercises

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