Wiki**3 - Recent changes [en]

Bottom-Up Parsing

Root — Sun, 26 Apr 2026 19:12:23 GMT

Building LALR(1) Parse Tables

← Older revision		Revision as of 19:12, 26 April 2026
Line 140:		Line 140:
	== Building LALR(1) Parse Tables ==		== Building LALR(1) Parse Tables ==

	The ~~following~~ video presents the complete process of building a parser.		The video presents the complete process of building a parser.

	The grammar is the one from [[Bottom-Up Parsing/Exercise 9: LALR(1)\|Exercise 9: LALR(1)]] (also below).		The grammar is the one from [[Bottom-Up Parsing/Exercise 9: LALR(1)\|Exercise 9: LALR(1)]] (also below).

	~~<runphp>~~		[https://www.youtube.com/embed/qdFUxuRLDeg video]
	~~echo<<<___EOT___~~
	~~<iframe width="560" height="315" src="~~https://www.youtube.com/embed/qdFUxuRLDeg~~" frameborder="0" allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen></iframe>~~
	~~___EOT___;~~
	~~</runphp>~~

	== Compacting Parse Tables ==		== Compacting Parse Tables ==

Attribute Grammars/Exercise 7: Lines, characters, and CRCs

Root — Sun, 26 Apr 2026 19:08:26 GMT

Solution

← Older revision		Revision as of 19:08, 26 April 2026
Line 27:		Line 27:

	A YACC specification can be obtained by adapting the grammar above:		A YACC specification can be obtained by adapting the grammar above:
	~~<text>~~
	%union { int i; }		%union { int i; }
	%token<i> CHR		%token<i> CHR
Line 38:		Line 37:
	line : line CHR { $$ = $1 ^ $2; }		line : line CHR { $$ = $1 ^ $2; }
	%%		%%
	~~</text>~~

	[[category:Compiladores]]		[[category:Compiladores]]
	[[category:Ensino]]		[[category:Ensino]]

Introduction to Syntax/Exercise 1

Root — Sun, 26 Apr 2026 19:04:26 GMT

← Older revision		Revision as of 19:04, 26 April 2026
Line 18:		Line 18:
	2. The following two trees are possible for '''true and false and true''' (an analogous analysis could be done for '''or'''). The fact that more than one tree can be found (independently of the method used), is a signal that the grammar is ambiguous. In the case shown, the ambiguity manifests itself in the associativity of the '''and''' operator (similar finding can be shown for '''or''' -- this is left as an exercise). In the trees, terminal symbols (a.k.a. tokens) are in blue and non-terminal symbols are in black.		2. The following two trees are possible for '''true and false and true''' (an analogous analysis could be done for '''or'''). The fact that more than one tree can be found (independently of the method used), is a signal that the grammar is ambiguous. In the case shown, the ambiguity manifests itself in the associativity of the '''and''' operator (similar finding can be shown for '''or''' -- this is left as an exercise). In the trees, terminal symbols (a.k.a. tokens) are in blue and non-terminal symbols are in black.

	<~~dot-hack~~>		<kroki lang="graphviz">
	graph nfa {		graph nfa {
	node [shape=plaintext]		node [shape=plaintext]
Line 72:		Line 72:
	26 -- 31 -- 32 -- 33		26 -- 31 -- 32 -- 33
	}		}
	</~~dot-hack~~>		</kroki>


Line 83:		Line 83:
	4. The following analysis considers the grammar defined in 3 (again, terminals are in blue and non-terminals in black).		4. The following analysis considers the grammar defined in 3 (again, terminals are in blue and non-terminals in black).

	<~~dot-hack~~>		<kroki lang="graphviz">
	graph nfa {		graph nfa {
	node [shape=plaintext]		node [shape=plaintext]
Line 125:		Line 125:
	4 -- 19		4 -- 19
	}		}
	</~~dot-hack~~>		</kroki>

	[[category:Compiladores]]		[[category:Compiladores]]
	[[category:Ensino]]		[[category:Ensino]]

Introduction to Syntax

Root — Sun, 26 Apr 2026 19:02:35 GMT

← Older revision		Revision as of 19:02, 26 April 2026
Line 10:		Line 10:
	* Direct derivation: <math>u\underset{G}{\Rightarrow}v\;\text{iff}\;\exists_{w_1,w_2\in{}V^*}: \exists_{(u',v')\in{}R}: u=w_1u'w_2 \wedge v=w_1v'w_2</math>		* Direct derivation: <math>u\underset{G}{\Rightarrow}v\;\text{iff}\;\exists_{w_1,w_2\in{}V^*}: \exists_{(u',v')\in{}R}: u=w_1u'w_2 \wedge v=w_1v'w_2</math>
	* Derivation: <math>w_0\underset{G}{\Rightarrow}w_1\underset{G}{\Rightarrow}\cdots\underset{G}{\Rightarrow}w_n\;\Leftrightarrow{}w_0\overset{*}{\underset{G}{\Rightarrow}}w_n</math>		* Derivation: <math>w_0\underset{G}{\Rightarrow}w_1\underset{G}{\Rightarrow}\cdots\underset{G}{\Rightarrow}w_n\;\Leftrightarrow{}w_0\overset{*}{\underset{G}{\Rightarrow}}w_n</math>
	* Generated language: <math>L(G) = \{ w\~~: \|\:~~ w \in \Sigma^* \~~wedge{}~~S\~~overset~~{*}{\~~underset~~{G}{\Rightarrow}}w \}</math>		* Generated language: <math>L(G) = \{ w \mid w \in \Sigma^* \land S \underset{G}{\overset{*}{\Rightarrow}} w \}</math>

	== Context-free Grammars ==		== Context-free Grammars ==

Theoretical Aspects of Lexical Analysis/Exercise 18

Root — Sun, 26 Apr 2026 18:53:51 GMT

← Older revision		Revision as of 18:53, 26 April 2026
Line 9:		Line 9:
	State '''5''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''18''' recognizes token '''T3'''.		State '''5''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''18''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 47:		Line 47:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 195:		Line 195:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 225:		Line 225:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 245:		Line 245:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.		Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mindfa {		digraph mindfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 266:		Line 266:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Theoretical Aspects of Lexical Analysis

Root — Sun, 26 Apr 2026 18:52:52 GMT

Exercises (set 2)

← Older revision		Revision as of 18:52, 26 April 2026
Line 430:		Line 430:
	* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 17\|Exercise 17]]: <nowiki>G = { a, ba, a*\|b }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 17\|Exercise 17]]: <nowiki>G = { a, ba, a*\|b }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 18\|Exercise 18]]: <nowiki>G = { ab, (a\|c), bc* }</nowiki>, input string = abbcac		* [[Theoretical Aspects of Lexical Analysis/Exercise 18\|Exercise 18]]: <nowiki>G = { ab, (a\|c), bc* }</nowiki>, input string = abbcac
	* [[Theoretical Aspects of Lexical Analysis/Exercise 19\|Exercise 19]]: <nowiki>G = { a\|b, b\|c, c*\|a }</nowiki>, input string = abbcac		* [[Theoretical Aspects of Lexical Analysis/Exercise 19\|Exercise 19]]: <nowiki>G = { a\|b, b\|c, c*\|a }</nowiki>, input string = abbcac

Theoretical Aspects of Lexical Analysis/Exercise 16

Root — Sun, 26 Apr 2026 18:52:08 GMT

← Older revision		Revision as of 18:52, 26 April 2026
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''5''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''21''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''5''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''21''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 50:		Line 50:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 198:		Line 198:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 216:		Line 216:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 237:		Line 237:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows.		Given the minimization tree, the final minimal DFA is as follows.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 258:		Line 258:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Theoretical Aspects of Lexical Analysis/Exercise 15

Root — Sun, 26 Apr 2026 18:50:46 GMT

← Older revision		Revision as of 18:50, 26 April 2026
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''16''' recognizes token '''T2'''; and state '''21''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''16''' recognizes token '''T2'''; and state '''21''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 50:		Line 50:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 198:		Line 198:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 216:		Line 216:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 237:		Line 237:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows.		Given the minimization tree, the final minimal DFA is as follows.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 258:		Line 258:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Theoretical Aspects of Lexical Analysis

Root — Sun, 26 Apr 2026 18:49:34 GMT

Exercises (set 2)

← Older revision		Revision as of 18:49, 26 April 2026
(2 intermediate revisions by the same user not shown)
Line 424:		Line 424:
	* [[Theoretical Aspects of Lexical Analysis/Exercise 9\|Exercise 9]]: <nowiki>G = { a, ba, a\|b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 9\|Exercise 9]]: <nowiki>G = { a, ba, a\|b* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 10\|Exercise 10]]: <nowiki>G = { a\|b, ba, b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 10\|Exercise 10]]: <nowiki>G = { a\|b, ba, b* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 11\|Exercise 11]]: <nowiki>G = { ab, a, b*a }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 11\|Exercise 11]]: <nowiki>G = { ab, a, b*a }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 12\|Exercise 12]]: <nowiki>G = { b\|a, a, b\|a* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 12\|Exercise 12]]: <nowiki>G = { b\|a, a, b\|a* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 13\|Exercise 13]]: <nowiki>G = { a\|b, a\|b, a* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 13\|Exercise 13]]: <nowiki>G = { a\|b, a\|b, a* }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 14\|Exercise 14]]: <nowiki>G = { a\|b, a\|b, b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 14\|Exercise 14]]: <nowiki>G = { a\|b, a\|b, b* }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc

Theoretical Aspects of Lexical Analysis/Exercise 10

Root — Sun, 26 Apr 2026 18:45:01 GMT

← Older revision		Revision as of 18:45, 26 April 2026
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''17''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''13''' recognizes token '''T2'''; and state '''17''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 44:		Line 44:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 126:		Line 126:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 142:		Line 142:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 160:		Line 160:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The tree expansion for non-splitting sets has been omitted for simplicity ("a" transitions for super-state {0, 1}).		The tree expansion for non-splitting sets has been omitted for simplicity ("a" transitions for super-state {0, 1}).

Theoretical Aspects of Lexical Analysis/Exercise 9

Root — Sun, 26 Apr 2026 18:43:57 GMT

← Older revision		Revision as of 18:43, 26 April 2026
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''4''' recognizes the first expression (token '''T1'''); state '''9''' recognizes token '''T2'''; and state '''17''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''4''' recognizes the first expression (token '''T1'''); state '''9''' recognizes token '''T2'''; and state '''17''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 44:		Line 44:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 138:		Line 138:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 155:		Line 155:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 174:		Line 174:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.		Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mindfa {		digraph mindfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 194:		Line 194:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Theoretical Aspects of Lexical Analysis/Exercise 7

Root — Sun, 26 Apr 2026 18:42:29 GMT

← Older revision		Revision as of 18:42, 26 April 2026
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''12''' recognizes token '''T2'''; and state '''20''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''12''' recognizes token '''T2'''; and state '''20''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 48:		Line 48:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 130:		Line 130:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 145:		Line 145:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 163:		Line 163:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.		Given the minimization tree, the final minimal DFA is as follows. Note that states 2 and 4 cannot be the same since they recognize different tokens.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mindfa {		digraph mindfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 181:		Line 181:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Theoretical Aspects of Lexical Analysis/Exercise 6

Root — Sun, 26 Apr 2026 18:40:44 GMT

← Older revision		Revision as of 18:40, 26 April 2026
Line 9:		Line 9:
	State '''3''' recognizes the first expression (token '''T1'''); state '''8''' recognizes token '''T2'''; and state '''14''' recognizes token '''T3'''.		State '''3''' recognizes the first expression (token '''T1'''); state '''8''' recognizes token '''T2'''; and state '''14''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 37:		Line 37:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>
	}}		}}

Line 132:		Line 132:

	{{CollapsedCode\|Graphical representation of the DFA\|		{{CollapsedCode\|Graphical representation of the DFA\|
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 146:		Line 146:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>
	}}		}}

Line 152:		Line 152:
	Note that before considering transition behavior, states are split according to the token they recognize.		Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 166:		Line 166:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The tree expansion for sets {0, 4} and {1, 2} was only tested for "a" (sufficient).		The tree expansion for sets {0, 4} and {1, 2} was only tested for "a" (sufficient).

Theoretical Aspects of Lexical Analysis/Exercise 5

Root — Sun, 26 Apr 2026 18:39:04 GMT

← Older revision		Revision as of 18:39, 26 April 2026
Line 10:		Line 10:
	The following is the result of applying Thompson's algorithm. State '''3''' recognizes the first expression (token '''T1'''); state '''8''' recognizes token '''T2'''; and state '''14''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''3''' recognizes the first expression (token '''T1'''); state '''8''' recognizes token '''T2'''; and state '''14''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 40:		Line 40:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack>~~		</kroki>
	~~<!--~~
	~~<runphp>~~
	print '<div id="mynetwork2" style="height: 400px;"></div><script type="text/javascript">var container = document.getElementById("mynetwork2"); var nodes = [ {id: 0, label: "0", group: "all", level: 1}, {id: 1, label: "1", level: 2, group: "t1"}, {id: 2, label: "2", level: 3, group: "t1"}, {id: 3, label: "3", level: 4, borderWidth: 3, group: "t1"}, {id: 4, label: "4", level: 2, group: "t2"}, {id: 5, label: "5", level: 3, group: "t2"}, {id: 6, label: "6", level: 4, group: "t2"}, {id: 7, label: "7", level: 5, group: "t2"}, {id: 8, label: "8", level: 5, borderWidth: 3, group: "t2"}, {id: 9, label: "9", level: 2, group: "t3"}, {id: 10, label: "10", level: 3, group: "t3"}, {id: 11, label: "11", level: 4, group: "t3"}, {id: 12, label: "12", level: 3, group: "t3"}, {id: 13, label: "13", level: 4, group: "t3"}, {id: 14, label: "14", borderWidth: 3, level: 5, group: "t3"} ]; var edges = [ {from: 0, to: 1}, {from: 1, to: 2, label: "a" }, {from: 2, to: 3, label: "b" }, {from: 0, to: 4}, {from: 4, to: 5, label: "a" }, {from: 5, to: 6}, {from: 5, to: 8}, {from: 6, to: 7, label: "b" }, {from: 7, to: 6}, {from: 7, to: 8}, {from: 0, to: 9}, {from: 9, to: 10}, {from: 9, to: 12}, {from: 10, to: 11, label: "a" }, {from: 12, to: 13, label: "b" }, {from: 11, to: 14}, {from: 13, to: 14}, ]; var options = { groups: { t1: { color: { border: "#41a906", background: "#7be141", highlight: { border: "#41a906", background: "#7be141", } } }, t2: { color: { border: "#f31d22", background: "#fa8a8c", highlight: { border: "#f31d22", background: "#fa8a8c", } } }, t3: { color: { border: "#ffa500", background: "#ffff00", highlight: { border: "#ffa500", background: "#ffff00", } } } }, edges: { style: "arrow" }, nodes: { color: { background: "white", border: "#2B7CE9" }, radius: 30 }, hierarchicalLayout: { direction: "LR" }, zoomable: false }; var data = { nodes: nodes, edges: edges }; var network = new vis.Network(container, data, options);</script>';
	~~</runphp>~~
	-->

	== DFA ==		== DFA ==
Line 126:		Line 121:

	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 140:		Line 135:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>
	~~<!--~~
	~~<runphp>~~
	~~echo<<<___EOT___~~
	~~<nowiki><div id="mydfa" style="height: 250px; width: 100%;"></div>~~
	~~<script type="text/javascript">~~
	~~var container = document.getElementById("mydfa");~~
	var nodes = [ {id: 0, label: "0", group: "all", level: 1}, {id: 1, label: "1", level: 2, borderWidth: 4, group: "t2"}, {id: 2, label: "2", level: 2, borderWidth: 4, group: "t3"}, {id: 3, label: "3", level: 3, borderWidth: 4, group: "t1"}, {id: 4, label: "4", level: 4, borderWidth: 4, group: "t2"}, ];
	var edges = [ {from: 0, to: 1, label: "a" }, {from: 0, to: 2, label: "b" }, {from: 1, to: 3, label: "b" }, {from: 3, to: 4, label: "b" }, {from: 4, to: 4, label: "b" }, ]; var options = { groups: { t1: { color: { border: "#41a906", background: "#7be141", highlight: { border: "#41a906", background: "#7be141" } } }, t2: { color: { border: "#f31d22", background: "#fa8a8c", highlight: { border: "#f31d22", background: "#fa8a8c" } } }, t3: { color: { border: "#ffa500", background: "#ffff00", highlight: { border: "#ffa500", background: "#ffff00" } } } }, edges: { style: "arrow", color: { color: "black", highlight: "black" }, labelAlignment: "line-above" }, nodes: { color: { background: "white", border: "#2B7CE9" }, shape: "circle", radius: 30 }, hierarchicalLayout: { nodeSpacing: 100, direction: "LR" }, zoomable: false };
	~~var data = { nodes: nodes, edges: edges };~~
	~~var network = new vis.Network(container, data, options);~~
	~~</script></nowiki>~~
	~~___EOT___;~~
	~~</runphp>~~
	~~-->~~
	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 169:		Line 151:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The tree expansion for non-splitting sets has been omitted for simplicity ("a" transition for final states {1, 4}).		The tree expansion for non-splitting sets has been omitted for simplicity ("a" transition for final states {1, 4}).

Theoretical Aspects of Lexical Analysis/Exercise 4

Root — Sun, 26 Apr 2026 18:36:45 GMT

Show changes

Theoretical Aspects of Lexical Analysis/Exercise 3

Root — Sun, 26 Apr 2026 18:24:58 GMT

← Older revision		Revision as of 18:24, 26 April 2026
Line 16:		Line 16:
	<!-- ====================== START OF SOLUTION ====================== -->		<!-- ====================== START OF SOLUTION ====================== -->
	The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>((ε\|a)b)*</nowiki>''' is the following:		The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>((ε\|a)b)*</nowiki>''' is the following:
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 33:		Line 33:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Applying the determination algorithm to the above NFA, the following determination table is obtained:		Applying the determination algorithm to the above NFA, the following determination table is obtained:
Line 89:		Line 89:
	! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \|Graphically, the DFA is represented as follows:		! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \|Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 103:		Line 103:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree to the right, the final minimal DFA is:		Given the minimization tree to the right, the final minimal DFA is:
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfamin {		digraph dfamin {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 118:		Line 118:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \| The minimization tree is as follows.		! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \| The minimization tree is as follows.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.2,fontsize=10]		node [shape=none,fixedsize=true,width=0.2,fontsize=10]
Line 130:		Line 130:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>
	\|}		\|}
	<!-- ====================== END OF SOLUTION ====================== -->		<!-- ====================== END OF SOLUTION ====================== -->

Theoretical Aspects of Lexical Analysis/Exercise 1

Root — Sun, 26 Apr 2026 18:22:27 GMT

← Older revision		Revision as of 18:22, 26 April 2026
Line 18:		Line 18:
	The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>(a\|b)*</nowiki>''' is the following:		The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>(a\|b)*</nowiki>''' is the following:
	{{CollapsedCode\|NFA for <nowiki>(a\|b)*</nowiki>\|		{{CollapsedCode\|NFA for <nowiki>(a\|b)*</nowiki>\|
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 37:		Line 37:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>
	}}		}}

Line 93:		Line 93:
	{\| width="100%"		{\| width="100%"
	! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \|Graphically, the DFA is represented as follows:		! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \|Graphically, the DFA is represented as follows:
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 108:		Line 108:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree to the right, the final minimal DFA is:		Given the minimization tree to the right, the final minimal DFA is:
	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfamin {		digraph dfamin {
	{ node [shape=circle style=invis] start }		{ node [shape=circle style=invis] start }
Line 123:		Line 123:
	/label="DFA for (a\|b)"*/		/label="DFA for (a\|b)"*/
	}		}
	</~~dot-hack~~>		</kroki>

	! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \| The minimization tree is as follows. As can be seen, the states are indistinguishable.		! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" \| The minimization tree is as follows. As can be seen, the states are indistinguishable.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.2,fontsize=10]		node [shape=none,fixedsize=true,width=0.2,fontsize=10]
Line 136:		Line 136:
	/label="Minimization tree"/		/label="Minimization tree"/
	}		}
	</~~dot-hack~~>		</kroki>
	\|}		\|}
	<!-- ====================== END OF SOLUTION ====================== -->		<!-- ====================== END OF SOLUTION ====================== -->

Theoretical Aspects of Lexical Analysis/Exercise 12

Root — Sun, 26 Apr 2026 18:20:53 GMT

DFA

← Older revision		Revision as of 18:20, 26 April 2026
(One intermediate revision by the same user not shown)
Line 7:		Line 7:
	The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''12''' recognizes token '''T2'''; and state '''20''' recognizes token '''T3'''.		The following is the result of applying Thompson's algorithm. State '''8''' recognizes the first expression (token '''T1'''); state '''12''' recognizes token '''T2'''; and state '''20''' recognizes token '''T3'''.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph nfa {		digraph nfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 48:		Line 48:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== DFA ==		== DFA ==
Line 130:		Line 130:
	Graphically, the DFA is represented as follows:		Graphically, the DFA is represented as follows:

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph dfa {		digraph dfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 145:		Line 145:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.		The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mintree {		digraph mintree {
	node [shape=none,fixedsize=true,width=0.3,fontsize=10]		node [shape=none,fixedsize=true,width=0.3,fontsize=10]
Line 162:		Line 162:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	Given the minimization tree, the final minimal DFA is as follows. Note that states 1 and 3 cannot be the same since they recognize different tokens.		Given the minimization tree, the final minimal DFA is as follows. Note that states 1 and 3 cannot be the same since they recognize different tokens.

	<~~dot-hack~~>		<kroki lang="graphviz">
	digraph mindfa {		digraph mindfa {
	{ node [shape=circle style=invis] s }		{ node [shape=circle style=invis] s }
Line 180:		Line 180:
	fontsize=10		fontsize=10
	}		}
	</~~dot-hack~~>		</kroki>

	== Input Analysis ==		== Input Analysis ==

Compiladores/Projecto de Compiladores/Material de Apoio ao Desenvolvimento

Root — Fri, 24 Apr 2026 09:45:24 GMT

Pacotes binários para instalação

Compiladores/Projecto de Compiladores/Projecto 2025-2026/Manual de Referência da Linguagem P6 (rascunho)

Root — Fri, 24 Apr 2026 01:30:49 GMT

Redirected page to Compiladores/Projecto de Compiladores/Projecto 2025-2026/Manual de Referência da Linguagem P6

Show changes

Compiladores/Projecto de Compiladores/Projecto 2025-2026/Manual de Referência da Linguagem P6

Root — Fri, 24 Apr 2026 01:30:31 GMT

Show changes

Template:CDKRTS

Root — Fri, 24 Apr 2026 01:28:18 GMT

← Older revision		Revision as of 01:28, 24 April 2026
Line 12:		Line 12:
	! style="padding-left:10px; padding-right:10px; border-style: solid; border-width: 1px; border-bottom-width: 0px; border-color: #bbbbaa; background: #ffdb24;" \| '''<font color="brown">Uso Obrigatório: Repositório GIT</font>'''		! style="padding-left:10px; padding-right:10px; border-style: solid; border-width: 1px; border-bottom-width: 0px; border-color: #bbbbaa; background: #ffdb24;" \| '''<font color="brown">Uso Obrigatório: Repositório GIT</font>'''
	\|-		\|-
	! style="padding-left:10px; padding-right:10px; font-weight: normal; border-style: solid; border-width: 0px; border-color: #bbbbaa; " \| '''Apenas se consideram para avaliação os projectos existentes no [[Compiladores/Projecto de Compiladores/Repositório GIT\|repositório GIT oficial]]'''. Apenas se considera para avaliação o ramo '''~~main~~'''.		! style="padding-left:10px; padding-right:10px; font-weight: normal; border-style: solid; border-width: 0px; border-color: #bbbbaa; " \| '''Apenas se consideram para avaliação os projectos existentes no [[Compiladores/Projecto de Compiladores/Repositório GIT\|repositório GIT oficial]]'''. Apenas se considera para avaliação o ramo '''master'''.

	Trabalhos não presentes no repositório no final do prazo têm classificação 0 (zero) (não são aceites outras formas de entrega). Não são admitidas justificações para atrasos em sincronizações do repositório. A indisponibilidade temporária do repositório, desde que inferior a 24 horas, não justifica atrasos na submissão de um trabalho.		Trabalhos não presentes no repositório no final do prazo têm classificação 0 (zero) (não são aceites outras formas de entrega). Não são admitidas justificações para atrasos em sincronizações do repositório. A indisponibilidade temporária do repositório, desde que inferior a 24 horas, não justifica atrasos na submissão de um trabalho.
	\|}		\|}

File:Simple-202604232308.tar.bz2

Root — Fri, 24 Apr 2026 01:26:34 GMT

Root uploaded File:Simple-202604232308.tar.bz2

New page

File:Pf2asm-202604232308.tar.bz2

Root — Fri, 24 Apr 2026 01:25:24 GMT

Root uploaded File:Pf2asm-202604232308.tar.bz2

New page

File:Tritak-202604232308.tar.bz2

Root — Fri, 24 Apr 2026 01:24:53 GMT

Root uploaded File:Tritak-202604232308.tar.bz2

New page

Compiladores/Projecto de Compiladores/Compiladores Exemplo

Root — Fri, 24 Apr 2026 01:22:58 GMT

Compilador "pf2asm"

← Older revision		Revision as of 01:22, 24 April 2026
(2 intermediate revisions by the same user not shown)
Line 13:		Line 13:
	O código do compilador Simple pode ser obtido aqui:		O código do compilador Simple pode ser obtido aqui:

	* Simple: [[media:simple-~~202604150000~~.tar.bz2]] <!--(esta versão não inclui suporte para LLVM)-->		* Simple: [[media:simple-202604232308.tar.bz2]] <!--(esta versão não inclui suporte para LLVM)-->

	A definição da linguagem Simple pode ser obtida por inspecção do código, especialmente estudando o léxico e a gramática.		A definição da linguagem Simple pode ser obtida por inspecção do código, especialmente estudando o léxico e a gramática.
Line 29:		Line 29:
	O código do compilador Tritak pode ser obtido aqui:		O código do compilador Tritak pode ser obtido aqui:

	* Tritak: [[media:tritak-~~202604150000~~.tar.bz2]] <!--(esta versão não inclui suporte para LLVM)-->		* Tritak: [[media:tritak-202604232308.tar.bz2]] <!--(esta versão não inclui suporte para LLVM)-->

	A definição da linguagem Tritak pode ser obtida por inspecção do código, especialmente estudando o léxico e a gramática.		A definição da linguagem Tritak pode ser obtida por inspecção do código, especialmente estudando o léxico e a gramática.
Line 41:		Line 41:
	Este compilador pode ser obtido aqui:		Este compilador pode ser obtido aqui:

	* pf2asm: [[media:pf2asm-~~202604150000~~.tar.bz2]]		* pf2asm: [[media:pf2asm-202604232308.tar.bz2]]

	{{Suggestion\|Aconselha-se a consulta do [[Postfix Reference Guide\|manual de referência da linguagem Postfix]].}}		{{Suggestion\|Aconselha-se a consulta do [[Postfix Reference Guide\|manual de referência da linguagem Postfix]].}}

File:Librts7-202604232308.tar.bz2

Root — Fri, 24 Apr 2026 01:21:47 GMT

Root uploaded File:Librts7-202604232308.tar.bz2

New page

File:Libcdk21-202604232308.tar.bz2

Root — Fri, 24 Apr 2026 01:21:21 GMT

Root uploaded File:Libcdk21-202604232308.tar.bz2

New page

Template:PRJCOMandatory20252026

Root — Fri, 24 Apr 2026 01:20:51 GMT

← Older revision		Revision as of 01:20, 24 April 2026
Line 1:		Line 1:
	{{CDKRTS\|CDK21\|libcdk21-~~202601160000~~.tar.bz2\|RTS7\|librts7-~~202601160000~~.tar.bz2}}		{{CDKRTS\|CDK21\|libcdk21-202604232308.tar.bz2\|RTS7\|librts7-202604232308.tar.bz2}}

Nodes from CDK and Simple

Root — Thu, 23 Apr 2026 08:36:14 GMT

CDK Nodes

← Older revision		Revision as of 08:36, 23 April 2026
Line 32:		Line 32:
	│ │ └── sub_node		│ │ └── sub_node
	│ ├── literal_node		│ ├── literal_node
			│ │ ├── balanced3_node
	│ │ ├── double_node		│ │ ├── double_node
	│ │ ├── integer_node		│ │ ├── integer_node
	│ │ └── ~~string_node~~		│ │ ├── posit3_node
			│ │ ├── string_node
			│ │ └── takum3_node
	│ ├── rvalue_node		│ ├── rvalue_node
	│ └── unary_operation_node		│ └── unary_operation_node
Line 70:		Line 73:

	* '''literal_node''' -- node that represents generic literal nodes		* '''literal_node''' -- node that represents generic literal nodes
	** '''double_node''' '''integer_node''' '''string_node''' -- ~~specific~~ literal ~~nodes~~		** '''double_node''' '''integer_node''' -- literal nodes for binary numbers
			** '''balanced3_node''' '''posit3_node''' '''takum3_node''' -- literal nodes for ternary numbers
			** '''string_node''' -- literal node for strings

	=== Other Nodes ===		=== Other Nodes ===

Compiladores/Projecto de Compiladores/Projecto 2025-2026/Manual de Referência da Linguagem P6 (rascunho)

Root — Wed, 22 Apr 2026 15:23:20 GMT

Identificadores

Show changes

Compiladores/Projecto de Compiladores/Máquina Virtual

Root — Tue, 21 Apr 2026 10:12:55 GMT

Máquina Virtual

← Older revision		Revision as of 10:12, 21 April 2026
Line 8:		Line 8:
	A versão mais recente da máquina virtual da disciplina, '''klang''', está disponível em:		A versão mais recente da máquina virtual da disciplina, '''klang''', está disponível em:

	* https://download.opensuse.org/repositories/home:/d4vid:/~~co25~~/images/		* https://download.opensuse.org/repositories/home:/d4vid:/co26/images/

	A máquina virtual é fornecida nos formatos VMDK (VMware, VirtualBox), VHD (Microsoft HyperV) e qcow2 (KVM e outros).		A máquina virtual é fornecida nos formatos VMDK (VMware, VirtualBox), VHD (Microsoft HyperV) e qcow2 (KVM e outros).

← Older revision		Revision as of 18:52, 26 April 2026
Line 430:		Line 430:
	* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 17\|Exercise 17]]: <nowiki>G = { a, ba, a*\|b }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 17\|Exercise 17]]: <nowiki>G = { a, ba, a*\|b }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 18\|Exercise 18]]: <nowiki>G = { ab, (a\|c), bc* }</nowiki>, input string = abbcac		* [[Theoretical Aspects of Lexical Analysis/Exercise 18\|Exercise 18]]: <nowiki>G = { ab, (a\|c), bc* }</nowiki>, input string = abbcac
	* [[Theoretical Aspects of Lexical Analysis/Exercise 19\|Exercise 19]]: <nowiki>G = { a\|b, b\|c, c*\|a }</nowiki>, input string = abbcac		* [[Theoretical Aspects of Lexical Analysis/Exercise 19\|Exercise 19]]: <nowiki>G = { a\|b, b\|c, c*\|a }</nowiki>, input string = abbcac

← Older revision		Revision as of 18:49, 26 April 2026
(2 intermediate revisions by the same user not shown)
Line 424:		Line 424:
	* [[Theoretical Aspects of Lexical Analysis/Exercise 9\|Exercise 9]]: <nowiki>G = { a, ba, a\|b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 9\|Exercise 9]]: <nowiki>G = { a, ba, a\|b* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 10\|Exercise 10]]: <nowiki>G = { a\|b, ba, b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 10\|Exercise 10]]: <nowiki>G = { a\|b, ba, b* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 11\|Exercise 11]]: <nowiki>G = { ab, a, b*a }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 11\|Exercise 11]]: <nowiki>G = { ab, a, b*a }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 12\|Exercise 12]]: <nowiki>G = { b\|a, a, b\|a* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 12\|Exercise 12]]: <nowiki>G = { b\|a, a, b\|a* }</nowiki>, input string = aababb
	* [[Theoretical Aspects of Lexical Analysis/Exercise 13\|Exercise 13]]: <nowiki>G = { a\|b, a\|b, a* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 13\|Exercise 13]]: <nowiki>G = { a\|b, a\|b, a* }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 14\|Exercise 14]]: <nowiki>G = { a\|b, a\|b, b* }</nowiki>, input string = aababb		* [[Theoretical Aspects of Lexical Analysis/Exercise 14\|Exercise 14]]: <nowiki>G = { a\|b, a\|b, b* }</nowiki>, input string = aababb (tbp)
	* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 15\|Exercise 15]]: <nowiki>G = { a\|c, a\|b, bc* }</nowiki>, input string = aaabcacc
	* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc		* [[Theoretical Aspects of Lexical Analysis/Exercise 16\|Exercise 16]]: <nowiki>G = { bc, a\|c, a\|b* }</nowiki>, input string = aaabcacc

← Older revision		Revision as of 09:45, 24 April 2026
(One intermediate revision by the same user not shown)
Line 8:		Line 8:
	O código presente nas bibliotecas de apoio (já instalado na máquina virtual) ao desenvolvimento do projecto é de uso obrigatório:		O código presente nas bibliotecas de apoio (já instalado na máquina virtual) ao desenvolvimento do projecto é de uso obrigatório:

	* CDK [[media:~~libcdk20~~-~~202408310000~~.tar.bz2]] - código de base para o desenvolvimento do compilador		* CDK [[media:libcdk21-202604232308.tar.bz2]] - código de base para o desenvolvimento do compilador
	* RTS [[media:~~librts6~~-~~20250414131211~~.tar.bz2]] - código de base para os programas gerados pelo compilador (runtime)		* RTS [[media:librts7-202604232308.tar.bz2]] - código de base para os programas gerados pelo compilador (runtime)

	{{CVSCode\|Notar que o [[Compiladores/Projecto de Compiladores/Repositório GIT\|repositório GIT]] já contém uma versão do projecto a desenvolver. Isto significa que ''antes'' de se começar a programar, o projecto deve ser obtido a partir do repositório.}}		{{CVSCode\|Notar que o [[Compiladores/Projecto de Compiladores/Repositório GIT\|repositório GIT]] já contém uma versão do projecto a desenvolver. Isto significa que ''antes'' de se começar a programar, o projecto deve ser obtido a partir do repositório.}}
Line 16:		Line 16:

	O manterial de apoio está disponível para instalação directa (não é necessário compilar) através do repositório:		O manterial de apoio está disponível para instalação directa (não é necessário compilar) através do repositório:
	* https://download.opensuse.org/repositories/home:/d4vid:/~~co25~~/openSUSE_Tumbleweed/		* https://download.opensuse.org/repositories/home:/d4vid:/co26/openSUSE_Tumbleweed/

	Este repositório pode ser adicionado a um openSUSE previamente instalado através do comando:		Este repositório pode ser adicionado a um openSUSE previamente instalado através do comando:

	<nowiki>zypper ar https://download.opensuse.org/repositories/home:/d4vid:/~~co25~~/openSUSE_Tumbleweed/ ~~CO25~~</nowiki>		<nowiki>zypper ar https://download.opensuse.org/repositories/home:/d4vid:/co26/openSUSE_Tumbleweed/ CO26</nowiki>
	<nowiki>zypper refresh</nowiki>		<nowiki>zypper refresh</nowiki>

	Uma vez adicionado o repositório, os pacotes acima podem ser instalados através dos comandos:		Uma vez adicionado o repositório, os pacotes acima podem ser instalados através dos comandos:

	zypper install ~~libcdk20~~-devel ~~librts6~~-devel		zypper install libcdk21-devel librts7-devel

	{{Suggestion\|Este material já está instalado na [[Compiladores/Projecto de Compiladores/Máquina Virtual\|máquina virtual da disciplina]].}}		{{Suggestion\|Este material já está instalado na [[Compiladores/Projecto de Compiladores/Máquina Virtual\|máquina virtual da disciplina]].}}