The YACC Parser Generator - Revision history

Root: /* Examples */

2026-04-29T10:00:18Z

Examples

← Older revision		Revision as of 10:00, 29 April 2026
Line 27:		Line 27:

	{ yydebug = 1; }		{ yydebug = 1; }

			== Videos ==
			* Part 1: Attribute Grammars: https://www.youtube.com/watch?v=eb1KP-RoMyY
			* Part 2: Attribute Grammars: https://www.youtube.com/watch?v=WQviJgOj3ac
			* Part 3: Attribute grammars and YACC/Bison: https://www.youtube.com/watch?v=1Mu-n34-kvw

	== Examples ==		== Examples ==

Root: /* Exercises */

2023-05-18T16:19:38Z

Exercises

← Older revision		Revision as of 16:19, 18 May 2023
Line 42:		Line 42:
	* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17
	* [[The YACC Parser Generator/Exercise 8\|Exercise 8]] -- number sequences		* [[The YACC Parser Generator/Exercise 8\|Exercise 8]] -- number sequences
			* [[The YACC Parser Generator/Exercise 9\|Exercise 9]] -- more number sequences

	== See Also ==		== See Also ==

Root at 07:32, 18 May 2023

2023-05-18T07:32:30Z

← Older revision		Revision as of 07:32, 18 May 2023
Line 4:		Line 4:
	YACC (yet another compiler compiler) is a grammar parser and parser generator. That is, it is a program that reads a grammar specification and generates code that is able to organize input tokens in a syntactic tree in accordance with the grammar. In addition, the grammar specification has semantic content (in the form of actions associated with grammar rules) that are also organized to be executed when tree nodes are built ("reduced" is the actual term).		YACC (yet another compiler compiler) is a grammar parser and parser generator. That is, it is a program that reads a grammar specification and generates code that is able to organize input tokens in a syntactic tree in accordance with the grammar. In addition, the grammar specification has semantic content (in the form of actions associated with grammar rules) that are also organized to be executed when tree nodes are built ("reduced" is the actual term).

	The parser generated by ~~Yacc~~ is an LALR(1) parser with a few pragmatic extensions to deal with non-LALR(1) grammars and other problems having to do with the fact that grammars sometimes are wrong and ~~Yacc~~ must signal those problems in a useful way, so that the grammar creator can improve it. Examples of these extensions are error handling (e.g. in case of conflicts). Theoretically, in the presence of conflicts, the parser could be said not to exist, but ~~Yacc~~ solves the problem by coding default behavior when needed. These behaviors may be what is needed, but, in general, it is an error using grammars that give rise to conflicts in the parser. These matters will be discussed below.		The parser generated by YACC is an LALR(1) parser with a few pragmatic extensions to deal with non-LALR(1) grammars and other problems having to do with the fact that grammars sometimes are wrong and YACC must signal those problems in a useful way, so that the grammar creator can improve it. Examples of these extensions are error handling (e.g. in case of conflicts). Theoretically, in the presence of conflicts, the parser could be said not to exist, but YACC solves the problem by coding default behavior when needed. These behaviors may be what is needed, but, in general, it is an error using grammars that give rise to conflicts in the parser. These matters will be discussed below.

	After a successful run, YACC will produce, at least, the '''yyparse()''' function, which runs the parser and produces the syntax-driven evaluation of the semantic actions in the rules. This function, when the appropriate actions are coded, produces the syntactic tree as a data structure (a tree, which may not come as much of a surprise).		After a successful run, YACC will produce, at least, the '''yyparse()''' function, which runs the parser and produces the syntax-driven evaluation of the semantic actions in the rules. This function, when the appropriate actions are coded, produces the syntactic tree as a data structure (a tree, which may not come as much of a surprise).

Root: /* Basic Concepts */

2023-05-18T07:31:44Z

Basic Concepts

← Older revision		Revision as of 07:31, 18 May 2023
Line 10:		Line 10:
	== Basic Concepts ==		== Basic Concepts ==

	~~Yacc~~ source files have three main sections divided by '''%%'''. The first section contains definitions and declarations used by YACC and the generated C code. The second section contains the grammar rules and associated semantic actions. The third section can contain additional C code to be copied directly to the output file (it is usually empty).		YACC source files have three main sections divided by '''%%'''. The first section contains definitions and declarations used by YACC and the generated C code. The second section contains the grammar rules and associated semantic actions. The third section can contain additional C code to be copied directly to the output file (it is usually empty).

	When ~~Yacc~~ runs, it reads the source file and generates a C source file (usually named '''y.tab.c'''), which contains the parsing function '''yyparse()'''. This function, when called, reads tokens, parses them according to the grammar rules, and executes the associated actions. This will usually result in building a parse tree, interpreting the program, or translating it into another language.		When YACC runs, it reads the source file and generates a C source file (usually named '''y.tab.c'''), which contains the parsing function '''yyparse()'''. This function, when called, reads tokens, parses them according to the grammar rules, and executes the associated actions. This will usually result in building a parse tree, interpreting the program, or translating it into another language.

	== Error Recovery ==		== Error Recovery ==

Root at 07:31, 18 May 2023

2023-05-18T07:31:22Z

← Older revision		Revision as of 07:31, 18 May 2023
Line 2:		Line 2:
	{{TOCright}}		{{TOCright}}

	~~Yacc~~ (yet another compiler compiler) is a grammar parser and parser generator. That is, it is a program that reads a grammar specification and generates code that is able to organize input tokens in a syntactic tree in accordance with the grammar. In addition, the grammar specification has semantic content (in the form of actions associated with grammar rules) that are also organized to be executed when tree nodes are built ("reduced" is the actual term).		YACC (yet another compiler compiler) is a grammar parser and parser generator. That is, it is a program that reads a grammar specification and generates code that is able to organize input tokens in a syntactic tree in accordance with the grammar. In addition, the grammar specification has semantic content (in the form of actions associated with grammar rules) that are also organized to be executed when tree nodes are built ("reduced" is the actual term).

	The parser generated by Yacc is an LALR(1) parser with a few pragmatic extensions to deal with non-LALR(1) grammars and other problems having to do with the fact that grammars sometimes are wrong and Yacc must signal those problems in a useful way, so that the grammar creator can improve it. Examples of these extensions are error handling (e.g. in case of conflicts). Theoretically, in the presence of conflicts, the parser could be said not to exist, but Yacc solves the problem by coding default behavior when needed. These behaviors may be what is needed, but, in general, it is an error using grammars that give rise to conflicts in the parser. These matters will be discussed below.		The parser generated by Yacc is an LALR(1) parser with a few pragmatic extensions to deal with non-LALR(1) grammars and other problems having to do with the fact that grammars sometimes are wrong and Yacc must signal those problems in a useful way, so that the grammar creator can improve it. Examples of these extensions are error handling (e.g. in case of conflicts). Theoretically, in the presence of conflicts, the parser could be said not to exist, but Yacc solves the problem by coding default behavior when needed. These behaviors may be what is needed, but, in general, it is an error using grammars that give rise to conflicts in the parser. These matters will be discussed below.

	After a successful run, ~~Yacc~~ will produce, at least, the yyparse() function, which runs the parser and produces the syntax-driven evaluation of the semantic actions in the rules. This function, when the appropriate actions are coded, produces the syntactic tree as a data structure (a tree, which may not come as much of a surprise).		After a successful run, YACC will produce, at least, the '''yyparse()''' function, which runs the parser and produces the syntax-driven evaluation of the semantic actions in the rules. This function, when the appropriate actions are coded, produces the syntactic tree as a data structure (a tree, which may not come as much of a surprise).

	== Basic Concepts ==		== Basic Concepts ==

	Yacc source files have three main sections divided by '''%%'''. The first section contains definitions and declarations used by ~~Yacc~~ and the generated C code. The second section contains the grammar rules and associated semantic actions. The third section can contain additional C code to be copied directly to the output file (it is usually empty).		Yacc source files have three main sections divided by '''%%'''. The first section contains definitions and declarations used by YACC and the generated C code. The second section contains the grammar rules and associated semantic actions. The third section can contain additional C code to be copied directly to the output file (it is usually empty).

	When Yacc runs, it reads the source file and generates a C source file (usually named y.tab.c), which contains the parsing function yyparse(). This function, when called, reads tokens, parses them according to the grammar rules, and executes the associated actions. This will usually result in building a parse tree, interpreting the program, or translating it into another language.		When Yacc runs, it reads the source file and generates a C source file (usually named '''y.tab.c'''), which contains the parsing function '''yyparse()'''. This function, when called, reads tokens, parses them according to the grammar rules, and executes the associated actions. This will usually result in building a parse tree, interpreting the program, or translating it into another language.

	== Error Recovery ==		== Error Recovery ==

Root: /* Basic Concepts */

2023-05-18T07:29:56Z

Basic Concepts

← Older revision		Revision as of 07:29, 18 May 2023
Line 10:		Line 10:
	== Basic Concepts ==		== Basic Concepts ==

	* Definitions		Yacc source files have three main sections divided by '''%%'''. The first section contains definitions and declarations used by Yacc and the generated C code. The second section contains the grammar rules and associated semantic actions. The third section can contain additional C code to be copied directly to the output file (it is usually empty).
	* Rules, ~~semantic~~ actions
	* Code		When Yacc runs, it reads the source file and generates a C source file (usually named y.tab.c), which contains the parsing function yyparse(). This function, when called, reads tokens, parses them according to the grammar rules, and executes the associated actions. This will usually result in building a parse tree, interpreting the program, or translating it into another language.

	== Error Recovery ==		== Error Recovery ==

Root: /* Exercises */

2022-05-27T15:24:33Z

Exercises

← Older revision		Revision as of 15:24, 27 May 2022
Line 41:		Line 41:
	* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17
	* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17
			* [[The YACC Parser Generator/Exercise 8\|Exercise 8]] -- number sequences

	== See Also ==		== See Also ==

Root: /* How to debug */

2021-05-26T18:48:53Z

How to debug

← Older revision		Revision as of 18:48, 26 May 2021
Line 24:		Line 24:
	export YYDEBUG=1		export YYDEBUG=1

	Add this to the rules section of the scanner file (.l)		Add this to the rules section of the scanner file (.l) (without any rule at the beginning of the line):

	{ yydebug = 1; }		{ yydebug = 1; }

	== Examples ==		== Examples ==

Root: /* How to debug */

2021-05-26T18:48:19Z

How to debug

← Older revision		Revision as of 18:48, 26 May 2021
Line 23:		Line 23:

	export YYDEBUG=1		export YYDEBUG=1

			Add this to the rules section of the scanner file (.l)

			{ yydebug = 1; }

	== Examples ==		== Examples ==

Root: /* Exercises */

2020-04-02T13:52:55Z

Exercises

← Older revision		Revision as of 13:52, 2 April 2020
Line 34:		Line 34:
	* [[The YACC Parser Generator/Exercise 3\|Exercise 3]]		* [[The YACC Parser Generator/Exercise 3\|Exercise 3]]
	* [[The YACC Parser Generator/Exercise 4\|Exercise 4]]		* [[The YACC Parser Generator/Exercise 4\|Exercise 4]]
	~~<!--~~
	* [[The YACC Parser Generator/Exercise 5\|Exercise 5]]		* [[The YACC Parser Generator/Exercise 5\|Exercise 5]]
	* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17
	* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17
	~~-->~~

	== See Also ==		== See Also ==

← Older revision		Revision as of 13:52, 2 April 2020
Line 34:		Line 34:
	* [[The YACC Parser Generator/Exercise 3\|Exercise 3]]		* [[The YACC Parser Generator/Exercise 3\|Exercise 3]]
	* [[The YACC Parser Generator/Exercise 4\|Exercise 4]]		* [[The YACC Parser Generator/Exercise 4\|Exercise 4]]
	~~<!--~~
	* [[The YACC Parser Generator/Exercise 5\|Exercise 5]]		* [[The YACC Parser Generator/Exercise 5\|Exercise 5]]
	* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 6\|Exercise 6]] -- maximum interval -- Test 2 2016/06/17
	* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17		* [[The YACC Parser Generator/Exercise 7\|Exercise 7]] -- minimum interval -- Test 2 2016/06/17
	~~-->~~

	== See Also ==		== See Also ==