User contributions for Root

29 March 2009

• 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...

28 March 2009

• 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

27 March 2009

• 12:2512:25, 27 March 2009 diff hist +7‎ Compiladores ‎No edit summary
• 12:2512:25, 27 March 2009 diff hist 0‎ Construção de Compiladores em C++ usando Objectos e Padrões ‎ →‎Who Should Read This Document?
• 12:1112:11, 27 March 2009 diff hist −4‎ Construção de Compiladores em C++ usando Objectos e Padrões ‎ →‎See Also
• 12:1012:10, 27 March 2009 diff hist −9‎ Construção de Compiladores em C++ usando Objectos e Padrões ‎ →‎Organization
• 12:1012:10, 27 March 2009 diff hist +7‎ Construção de Compiladores em C++ usando Objectos e Padrões ‎No edit summary
• 12:0812:08, 27 March 2009 diff hist −68‎ The Flex Lexical Analyzer ‎ →‎How to Debug a Flex Specification

25 March 2009

• 23:3823:38, 25 March 2009 diff hist +33‎ Actividade de Investigação ‎No edit summary current
• 14:2414:24, 25 March 2009 diff hist +2‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎Minimal DFA
• 14:2414:24, 25 March 2009 diff hist +2‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎Minimal DFA
• 14:2314:23, 25 March 2009 diff hist +8‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎Minimal DFA
• 14:2314:23, 25 March 2009 diff hist +2‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎Minimal DFA
• 14:2214:22, 25 March 2009 diff hist −46‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎Minimal DFA
• 14:1814:18, 25 March 2009 diff hist +17‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎DFA
• 14:1814:18, 25 March 2009 diff hist −189‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎DFA
• 14:1614:16, 25 March 2009 diff hist +136‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎DFA
• 14:1414:14, 25 March 2009 diff hist +963‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎DFA
• 14:0814:08, 25 March 2009 diff hist +717‎ Theoretical Aspects of Lexical Analysis/Exercise 4 ‎ →‎DFA

24 March 2009

• 10:5410:54, 24 March 2009 diff hist +30‎ Gestão de Memória (pilha elástica) ‎No edit summary current
• 10:5210:52, 24 March 2009 diff hist +213‎ Actividades Lectivas ‎No edit summary
• 10:4910:49, 24 March 2009 diff hist +75‎ Actividades Lectivas ‎ →‎Sistemas de Processamento de Língua Natural
• 10:4910:49, 24 March 2009 diff hist +76‎ Actividades Lectivas ‎No edit summary
• 10:4810:48, 24 March 2009 diff hist 0‎ Actividades Lectivas ‎No edit summary

22 March 2009

• 18:1818:18, 22 March 2009 diff hist −91‎ Theoretical Aspects of Lexical Analysis ‎No edit summary
• 18:1718:17, 22 March 2009 diff hist +1‎ Theoretical Aspects of Lexical Analysis ‎ →‎The Analysis Process and Backtracking
• 18:1718:17, 22 March 2009 diff hist +1,766‎ Theoretical Aspects of Lexical Analysis/Exercise 6 ‎No edit summary
• 04:4804:48, 22 March 2009 diff hist +6‎ Theoretical Aspects of Lexical Analysis/Exercise 6 ‎ →‎Input Analysis
• 04:4604:46, 22 March 2009 diff hist +1‎ Theoretical Aspects of Lexical Analysis/Exercise 6 ‎ →‎DFA
• 04:4604:46, 22 March 2009 diff hist +103‎ Theoretical Aspects of Lexical Analysis/Exercise 6 ‎ →‎DFA
• 04:4404:44, 22 March 2009 diff hist +10,538‎ N Theoretical Aspects of Lexical Analysis/Exercise 6 ‎ 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...