User contributions for Root
13 September 2011
- 10:4510:45, 13 September 2011 diff hist +9 Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos →Implementação do conceito "Animal"
- 10:4510:45, 13 September 2011 diff hist +1,580 Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos →Animal simples
- 10:4310:43, 13 September 2011 diff hist +12 Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos →Animal simples
- 10:4210:42, 13 September 2011 diff hist +72 Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos →Animal simples
- 10:4110:41, 13 September 2011 diff hist +13 Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos No edit summary
- 10:4010:40, 13 September 2011 diff hist +4,961 N Introdução aos Objectos/Objectos em C: Tipos de Dados Abstractos Created page with "Os exercícios seguintes ilustram a definição de tipos de dados abstractos e de suas instâncias. Estas instâncias são semelhantes aos objectos suportados por linguagens como..."
- 10:2110:21, 13 September 2011 diff hist +27 Introdução aos Objectos →Introdução à Programação com Objectos
- 10:2110:21, 13 September 2011 diff hist +306 Introdução aos Objectos →Introdução à Programação com Objectos
26 August 2011
- 10:0010:00, 26 August 2011 diff hist −142 Orientação Científica No edit summary
- 09:5109:51, 26 August 2011 diff hist +38 Apresentação No edit summary
4 August 2011
- 13:1713:17, 4 August 2011 diff hist +74 Actividades Lectivas →Projecto de Língua Natural
- 13:1613:16, 4 August 2011 diff hist +76 Actividades Lectivas →Sistemas de Processamento de Língua Natural
- 13:1613:16, 4 August 2011 diff hist +64 Actividades Lectivas →Programação com Objectos
- 13:1513:15, 4 August 2011 diff hist +75 Actividades Lectivas →Compiladores
22 June 2011
- 09:5609:56, 22 June 2011 diff hist +234 The Flex Lexical Analyzer/Exercise 7 - Text processing →The Problem (in Portuguese)
- 09:5209:52, 22 June 2011 diff hist 0 N File:Acordo.l No edit summary current
- 09:5209:52, 22 June 2011 diff hist +3,366 N The Flex Lexical Analyzer/Exercise 7 - Text processing Created page with "{{TOCright}} == The Problem (in Portuguese) == Pretende-se converter texto escrito em português antigo para o novo acordo ortográfico. O programa a desenvolver recebe, na ent..."
- 09:4909:49, 22 June 2011 diff hist +91 The Flex Lexical Analyzer →Exercises
15 June 2011
- 18:1718:17, 15 June 2011 diff hist +6 Attribute Grammars/Exercise 8: Arithmetic →Semantic Tree
- 18:1618:16, 15 June 2011 diff hist 0 N File:Arithmetic-t21011-153034.png No edit summary current
- 16:1916:19, 15 June 2011 diff hist +52 Attribute Grammars/Exercise 8: Arithmetic →Solution
- 16:1916:19, 15 June 2011 diff hist +3,906 N Attribute Grammars/Exercise 8: Arithmetic Created page with "{{TOCright}} == Problem (in Portuguese) == (appeared in Teste 2 2010/2011) Pretende-se criar uma gramática atributiva que calcule no símbolo inicial o valor das expressões f..."
- 15:4715:47, 15 June 2011 diff hist +92 Attribute Grammars No edit summary
21 May 2011
- 15:5215:52, 21 May 2011 diff hist +1,653 N Code Generation/Exercise 7 Created page with "== The Original Code == Consider the following C function: <c> int *traverse(int vec[], int lim) { int *ptr = vec + lim - 1, ix = lim - 2; while (ix >= 0) { ptr = (vec[..."
- 15:3715:37, 21 May 2011 diff hist +6 Code Generation/Exercise 6 No edit summary
- 15:3615:36, 21 May 2011 diff hist +57 Code Generation →Examples
16 May 2011
- 15:3115:31, 16 May 2011 diff hist +1,039 N Code Generation/Exercise 6 Created page with "== The Original Code == Consider the following C function: <c> int powmod(int base, int exp, int modulus) { int accum = 1, i = 0, basepow2 = base; while ((exp >> i) > 0) { ..."
- 15:2415:24, 16 May 2011 diff hist +55 Code Generation →Examples
- 15:2315:23, 16 May 2011 diff hist +522 N Code Generation/Exercise 5 Created page with "== The Original Code == Consider the following C function: <c> int gcd(int a, int b) { static int temp = 0; if (temp) temp = swap(&a, &b); while (1) { a %= b; if ..."
- 15:2115:21, 16 May 2011 diff hist +53 Code Generation →Examples
- 15:1815:18, 16 May 2011 diff hist +3 Bottom-Up Parsing/Example 3: SLR(1) →Problem
- 15:1815:18, 16 May 2011 diff hist +217 N Bottom-Up Parsing/Example 4: LALR(1) Created page with "{{TOCright}} = Problem = S -> L = R | R L -> * R | id R -> L Initial symbol: S Terminals: { =, *, id } Input: Compact. Is this an SLR(1) grammar? == Solution == [[cat..."
- 15:1715:17, 16 May 2011 diff hist +62 Bottom-Up Parsing →Examples and Exercises
- 15:1615:16, 16 May 2011 diff hist +28 Bottom-Up Parsing/Example 3: SLR(1) →Problem
- 15:1615:16, 16 May 2011 diff hist +27 Bottom-Up Parsing/Example 2: SLR(1) →Problem
- 15:1515:15, 16 May 2011 diff hist +15 Bottom-Up Parsing/Example 2: SLR(1) No edit summary
- 15:1515:15, 16 May 2011 diff hist +15 Bottom-Up Parsing/Example 3: SLR(1) →Problem
- 15:1415:14, 16 May 2011 diff hist +183 N Bottom-Up Parsing/Example 3: SLR(1) Created page with "{{TOCright}} = Problem = S -> x A y | x B y | x A z B -> k A w S | k Initial symbol: S Terminals: { k, w, x, y, z } == Solution == category:Teaching [[category:Compil..."
- 15:1315:13, 16 May 2011 diff hist +60 Bottom-Up Parsing →Examples and Exercises
- 15:1315:13, 16 May 2011 diff hist +1 Bottom-Up Parsing/Example 2: SLR(1) →Problem
- 15:1315:13, 16 May 2011 diff hist +173 N Bottom-Up Parsing/Example 2: SLR(1) Created page with "{{TOCright}} = Problem = S -> 1 S 1 | 1 X 0 | 2 X -> 2 | S 1 | X 2 Initial symbol: S Terminals: { 0, 1, 2 } == Solution == category:Teaching category:Compilers"
- 15:1115:11, 16 May 2011 diff hist +60 Bottom-Up Parsing →Examples and Exercises
- 15:1015:10, 16 May 2011 diff hist +949 N The YACC Parser Generator/Exercise 1 Created page with "{{TOCright}} = Problem = Pretende-se utilizar a ferramenta YACC para criar um programa que aceite uma gramática livre de contexto e determine se esta é recursiva (directa ou i..."
- 15:0215:02, 16 May 2011 diff hist +72 The YACC Parser Generator No edit summary
- 14:5914:59, 16 May 2011 diff hist +636 N Top-Down Parsing/Exercise 8 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: A -> B C x |..."
- 14:5814:58, 16 May 2011 diff hist +45 Top-Down Parsing →Exercises
- 14:5714:57, 16 May 2011 diff hist +632 N Top-Down Parsing/Exercise 7 Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: X -> a A ..."
- 14:5614:56, 16 May 2011 diff hist +45 Top-Down Parsing →Exercises
- 14:5414:54, 16 May 2011 diff hist +632 N Top-Down Parsing/Exercise 6 Created page with "{{TOCright}} = 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: F -> G b |..."
- 14:5314:53, 16 May 2011 diff hist +45 Top-Down Parsing →Exercises