User contributions for Root
25 May 2009
- 08:5108:51, 25 May 2009 diff hist +4,413 S9 (language) →Gramática
- 07:5807:58, 25 May 2009 diff hist +10,310 S9 (language) No edit summary
- 07:4307:43, 25 May 2009 diff hist +27 N S9 Language S9 Language moved to S9 (language) current
- 07:4307:43, 25 May 2009 diff hist 0 m S9 (language) S9 Language moved to S9 (language)
- 07:4307:43, 25 May 2009 diff hist +2 Code Generation/Example 2 No edit summary
- 07:4207:42, 25 May 2009 diff hist +221 N S9 (language) New page: <font color="red">THIS DESCRIPTION CORRESPONDS TO VERSION 200905031425</font> '''OFFICIAL VERSION: https://fenix.ist.utl.pt/disciplinas/com-2/2008-2009/2-semestre/projecto''' [[category:...
- 07:3707:37, 25 May 2009 diff hist −22 Code Generation/Example 2 →Compiling and Running
- 07:3607:36, 25 May 2009 diff hist 0 Code Generation/Example 2 →Compiling and Running
- 07:3607:36, 25 May 2009 diff hist +327 Code Generation/Example 2 No edit summary
- 07:3107:31, 25 May 2009 diff hist +3 Code Generation/Example 2 →Postfix Code
- 07:3107:31, 25 May 2009 diff hist +3 Code Generation/Example 2 →The Original Code
- 07:3007:30, 25 May 2009 diff hist −5 Code Generation/Example 2 →Postfix Code
- 07:3007:30, 25 May 2009 diff hist +20 Code Generation/Example 2 No edit summary
- 07:2907:29, 25 May 2009 diff hist +643 N Code Generation/Example 2 New page: == The Original Code == Consider the following S9 function: <c> string a = "ola"; int s9() -> 0 { a! } </c> == Postfix Code == The Postfix code for the above func...
- 07:2607:26, 25 May 2009 diff hist +55 Code Generation/Example 1 →Postfix Code
- 07:2607:26, 25 May 2009 diff hist −14 Code Generation/Example 1 →The Original Code
- 07:2507:25, 25 May 2009 diff hist +6 Code Generation/Example 1 No edit summary
- 07:2407:24, 25 May 2009 diff hist +95 Code Generation →Examples
- 07:2407:24, 25 May 2009 diff hist +1,678 N Code Generation/Example 1 New page: == The Problem == Translate into Postfix the following C function. <c> int main() { int n = 45, i = 0, j = 1, *seg = &i; while (n-- > 0) { print(*seg = i + j); seg = (seg == &...
28 April 2009
- 14:0614:06, 28 April 2009 diff hist +11 Theoretical Aspects of Lexical Analysis →Regular Expressions
- 14:0414:04, 28 April 2009 diff hist +293 Theoretical Aspects of Lexical Analysis →Regular Expressions
- 14:0114:01, 28 April 2009 diff hist +36 Theoretical Aspects of Lexical Analysis →Regular Expressions
- 14:0014:00, 28 April 2009 diff hist 0 m Theoretical Aspects of Lexical Analysis →Regular Expressions
- 14:0014:00, 28 April 2009 diff hist 0 Theoretical Aspects of Lexical Analysis No edit summary
- 13:5513:55, 28 April 2009 diff hist +3 m Theoretical Aspects of Lexical Analysis/Exercise 12 No edit summary
19 April 2009
- 19:3019:30, 19 April 2009 diff hist −17 m Attribute Grammars/Exercise 2: Numbers No edit summary
- 19:0019:00, 19 April 2009 diff hist +275 Attribute Grammars/Exercise 1: Traffic Light →Solution
- 18:5218:52, 19 April 2009 diff hist +2,042 Attribute Grammars/Exercise 1: Traffic Light No edit summary
- 18:3718:37, 19 April 2009 diff hist +58 N Attribute Grammars/Exercise 1: Semaphore Attribute Grammars/Exercise 1: Semaphore moved to Attribute Grammars/Exercise 1: Traffic Light current
- 18:3718:37, 19 April 2009 diff hist 0 m Attribute Grammars/Exercise 1: Traffic Light Attribute Grammars/Exercise 1: Semaphore moved to Attribute Grammars/Exercise 1: Traffic Light
- 18:3718:37, 19 April 2009 diff hist +4 Attribute Grammars No edit summary
- 18:3718:37, 19 April 2009 diff hist +4 Attribute Grammars No edit summary
18 April 2009
- 15:1615:16, 18 April 2009 diff hist +1,878 N Attribute Grammars/Exercise 3: Expressions New page: <p><span lang="pt">A gramática seguinte admite atribuições dentro de expressões.</span></p> <table border="0" cellpadding="3"> <tr> <td align="right">S</td> <td...
- 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
6 April 2009
- 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
30 March 2009
- 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
29 March 2009
- 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