User contributions for Root
26 May 2010
- 13:1913:19, 26 May 2010 diff hist +2,092 N Optimization Topics New page: == Basic Blocks == Instruction sequence where control flow starts at the first instruction and ends at the last, without jumps (except at the last instruction). Transformations in a basi...
- 12:5812:58, 26 May 2010 diff hist +26 Tópicos sobre Construção de Compiladores No edit summary
25 April 2010
- 17:2417:24, 25 April 2010 diff hist 0 Attribute Grammars/Exercise 4: Expressions with bases (1) No edit summary
- 16:4316:43, 25 April 2010 diff hist −9 Attribute Grammars/Exercise 4: Expressions with bases (1) →Solution
- 16:2216:22, 25 April 2010 diff hist −139 Attribute Grammars/Exercise 4: Expressions with bases (1) →Solution
- 16:2016:20, 25 April 2010 diff hist +139 Attribute Grammars/Exercise 4: Expressions with bases (1) No edit summary
- 16:1916:19, 25 April 2010 diff hist +1,045 Attribute Grammars/Exercise 4: Expressions with bases (1) No edit summary
- 15:5115:51, 25 April 2010 diff hist +2 Attribute Grammars/Exercise 4: Expressions with bases (1) →Problem (in Portuguese)
- 15:5015:50, 25 April 2010 diff hist +834 N Attribute Grammars/Exercise 4: Expressions with bases (1) New page: == Problem (in Portuguese) == Pretende-se criar uma gramática atributiva que some uma sequência de inteiros separados por '''+'''. Os inteiros podem estar codificados sob o formato deci...
- 15:4915:49, 25 April 2010 diff hist +985 N Attribute Grammars/Exercise 5: Expressions with bases (2) New page: == Problem (in Portuguese) == Pretende-se criar uma gramática atributiva que some uma sequência de inteiros separados por '''+'''. A expressão tem no início a base de trabalho (valor ...
- 15:4415:44, 25 April 2010 diff hist +30 Attribute Grammars/Exercise 3: Expressions No edit summary
- 15:4315:43, 25 April 2010 diff hist +206 Attribute Grammars No edit summary
24 April 2010
- 19:3319:33, 24 April 2010 diff hist +14 Top-Down Parsing/Exercise 4: Test 2010/04/17 →FIRST and FOLLOW Sets
- 19:3319:33, 24 April 2010 diff hist +3,524 N Top-Down Parsing/Exercise 4: Test 2010/04/17 New page: {{TOCright}} = Problem = Consider the following grammar, where '''<tt>B</tt>''' is the initial symbol and '''<tt>{w,x,y,z}</tt>''' is the set of terminal symbols: A -> y B -> B x C | C...
- 18:5718:57, 24 April 2010 diff hist +79 Top-Down Parsing No edit summary
- 18:1818:18, 24 April 2010 diff hist +24 The Flex Lexical Analyzer/Exercise 6 - Playlist processing No edit summary
- 18:1818:18, 24 April 2010 diff hist +1,714 The Flex Lexical Analyzer/Exercise 6 - Playlist processing No edit summary
- 18:1518:15, 24 April 2010 diff hist +82 N File:Playlist.txt Test file for the playlist processor. category:Compilers category:Teaching
- 18:1418:14, 24 April 2010 diff hist 0 The Flex Lexical Analyzer/Exercise 6 - Playlist processing No edit summary
- 18:1318:13, 24 April 2010 diff hist +82 N File:Playlist.l Flex code for the playlist processor. category:Compilers category:Teaching
- 18:1118:11, 24 April 2010 diff hist +536 The Flex Lexical Analyzer/Exercise 6 - Playlist processing →Solution
- 17:5817:58, 24 April 2010 diff hist +13 The Flex Lexical Analyzer/Exercise 6 - Playlist processing No edit summary
- 17:5817:58, 24 April 2010 diff hist +2,603 N The Flex Lexical Analyzer/Exercise 6 - Playlist processing New page: == The Problem (in Portuguese) == Crie um analisador lexical (especificação para a ferramenta Flex) que aceite uma lista de faixas musicais, contendo os respectivos títulos, artistas (...
- 17:5517:55, 24 April 2010 diff hist +99 The Flex Lexical Analyzer →Exercises
22 April 2010
- 19:1419:14, 22 April 2010 diff hist +17 Theoretical Aspects of Lexical Analysis/Exercise 15 →Input Analysis
- 19:1319:13, 22 April 2010 diff hist +15,960 N Theoretical Aspects of Lexical Analysis/Exercise 16 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, c }...
- 18:3218:32, 22 April 2010 diff hist +15,940 N Theoretical Aspects of Lexical Analysis/Exercise 15 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, c }...
- 17:1317:13, 22 April 2010 diff hist +274 Theoretical Aspects of Lexical Analysis No edit summary
19 April 2010
- 09:5709:57, 19 April 2010 diff hist +7 The Flex Lexical Analyzer/Exercise 1 - Printing the strings present in a C/C++ program →The Solution
- 09:5709:57, 19 April 2010 diff hist +156 The Flex Lexical Analyzer/Exercise 1 - Printing the strings present in a C/C++ program No edit summary
17 April 2010
16 April 2010
- 19:1919:19, 16 April 2010 diff hist +3 m Top-Down Parsing/Exercise 3 →Solution
- 19:1619:16, 16 April 2010 diff hist +29 Top-Down Parsing/Exercise 3 →Expanding F in G
- 19:1519:15, 16 April 2010 diff hist +13 Top-Down Parsing/Exercise 3 No edit summary
- 19:0719:07, 16 April 2010 diff hist +1,103 Top-Down Parsing/Exercise 3 →Solution
- 18:4118:41, 16 April 2010 diff hist −1 Top-Down Parsing/Exercise 3 →Expanding G in F
- 18:4018:40, 16 April 2010 diff hist −4 Top-Down Parsing/Exercise 3 →Expanding G in F
- 18:4018:40, 16 April 2010 diff hist −9 Top-Down Parsing/Exercise 3 →Expanding G in F
- 18:3918:39, 16 April 2010 diff hist +2,108 N Top-Down Parsing/Exercise 3 New page: = Problem = Consider the following grammar, where '''<tt>F</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: O -> a G -> F c | O c d | (eps) ...
- 18:2418:24, 16 April 2010 diff hist +63 Top-Down Parsing No edit summary
15 April 2010
- 10:4610:46, 15 April 2010 diff hist 0 Attribute Grammars No edit summary
14 April 2010
- 19:3519:35, 14 April 2010 diff hist +13,625 Top-Down Parsing/Example 2 →Solution
12 April 2010
- 20:1820:18, 12 April 2010 diff hist −4 Top-Down Parsing/Example 1 No edit summary
- 16:5016:50, 12 April 2010 diff hist −28 Top-Down Parsing/Example 1 No edit summary
11 April 2010
- 20:5820:58, 11 April 2010 diff hist +179 Introduction to Syntax →The FIRST and FOLLOW sets
- 19:5319:53, 11 April 2010 diff hist +27 The Flex Lexical Analyzer/Exercise 1 - Printing the strings present in a C/C++ program No edit summary
- 19:5319:53, 11 April 2010 diff hist +27 The Flex Lexical Analyzer/Exercise 2 - Printing the number of times access operators are used No edit summary
- 19:5319:53, 11 April 2010 diff hist +27 The Flex Lexical Analyzer/Exercise 3 - Printing the comments present in a C/C++ program →The Solution
- 19:5319:53, 11 April 2010 diff hist +27 The Flex Lexical Analyzer/Exercise 4 - Removing the actions from a YACC specification →The Solution
- 19:5319:53, 11 April 2010 diff hist +27 The Flex Lexical Analyzer/Exercise 5 - Removing the actions from a Flex specification →The Solution