Special

User contributions for Root

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

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

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

08:2508:25, 17 April 2010 diff hist 0 Top-Down Parsing →Exercises

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

10:4610:46, 15 April 2010 diff hist 0 Attribute Grammars No edit summary

19:3519:35, 14 April 2010 diff hist +13,625 Top-Down Parsing/Example 2 →Solution

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

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
19:3319:33, 11 April 2010 diff hist +3,930 N The Flex Lexical Analyzer/Exercise 5 - Removing the actions from a Flex specification New page: == The Problem (in Portuguese) == Crie um analisador lexical (especificação para a ferramenta Flex) que aceite uma especificação Flex e que a copie para a saída sem as acções assoc...
19:3119:31, 11 April 2010 diff hist +2,410 N The Flex Lexical Analyzer/Exercise 4 - Removing the actions from a YACC specification New page: == The Problem (in Portuguese) == Crie um analisador lexical (especificação para a ferramenta Flex) que aceite uma especificação YACC e que a copie para a saída sem as acções semâ...
19:3019:30, 11 April 2010 diff hist −12 The Flex Lexical Analyzer/Exercise 2 - Printing the number of times access operators are used No edit summary
19:3019:30, 11 April 2010 diff hist +1,207 N The Flex Lexical Analyzer/Exercise 3 - Printing the comments present in a C/C++ program New page: == The Problem (in Portuguese) == Com o objectivo de gerar documentação, crie um analisador lexical (para a ferramenta Flex) que aceite um programa em C++ e que tenha como saída apenas...
19:2919:29, 11 April 2010 diff hist +1,393 N The Flex Lexical Analyzer/Exercise 2 - Printing the number of times access operators are used New page: == The Problem (in Portuguese) == Com o objectivo de gerar documentação, crie um analisador lexical (para a ferramenta Flex) que aceite um programa em C++ e que tenha como saída apenas...
19:2819:28, 11 April 2010 diff hist +1,252 N The Flex Lexical Analyzer/Exercise 1 - Printing the strings present in a C/C++ program New page: == The Problem (in Portuguese) == A internacionalização de software é uma tarefa que requer a localização de todas as cadeias de caracteres que existem em programas. Para facilitar o...
19:2519:25, 11 April 2010 diff hist −5 The Flex Lexical Analyzer →Exercises
19:2519:25, 11 April 2010 diff hist −4 The Flex Lexical Analyzer →Exercises
19:2519:25, 11 April 2010 diff hist +265 The Flex Lexical Analyzer →Exercises
19:2419:24, 11 April 2010 diff hist +378 The Flex Lexical Analyzer →Exercises

17:5717:57, 10 April 2010 diff hist −596 Top-Down Parsing/Example 1 No edit summary
17:5617:56, 10 April 2010 diff hist +8 Top-Down Parsing/Example 1 No edit summary
17:1617:16, 10 April 2010 diff hist −1,944 Top-Down Parsing/Example 1 No edit summary
17:1417:14, 10 April 2010 diff hist −590 Top-Down Parsing/Example 1 No edit summary
17:1217:12, 10 April 2010 diff hist +26,436 Top-Down Parsing/Example 1 No edit summary

14:3014:30, 9 April 2010 diff hist +40 N Recursive Descent Parsing: Example 3 Recursive Descent Parsing: Example 3 moved to Top-Down Parsing/Example 3 current
14:3014:30, 9 April 2010 diff hist −25,778 m Top-Down Parsing/Example 3 Recursive Descent Parsing: Example 3 moved to Top-Down Parsing/Example 3
14:2914:29, 9 April 2010 diff hist +40 N Recursive Descent Parsing: Example 2 Recursive Descent Parsing: Example 2 moved to Top-Down Parsing/Example 2 current
14:2914:29, 9 April 2010 diff hist −13,024 m Top-Down Parsing/Example 2 Recursive Descent Parsing: Example 2 moved to Top-Down Parsing/Example 2
14:2914:29, 9 April 2010 diff hist +40 N Recursive Descent Parsing: Example 1 Recursive Descent Parsing: Example 1 moved to Top-Down Parsing/Example 1 current
14:2914:29, 9 April 2010 diff hist −26,420 m Top-Down Parsing/Example 1 Recursive Descent Parsing: Example 1 moved to Top-Down Parsing/Example 1
14:2914:29, 9 April 2010 diff hist +20,171 Top-Down Parsing No edit summary

18:2718:27, 8 April 2010 diff hist +66 The Flex Lexical Analyzer →See Also
18:2618:26, 8 April 2010 diff hist +60 The Flex Lexical Analyzer No edit summary
08:1008:10, 8 April 2010 diff hist +1 Tópicos sobre Construção de Compiladores No edit summary
08:1008:10, 8 April 2010 diff hist −10 Tópicos sobre Construção de Compiladores No edit summary

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