Bottom-Up Parsing/Example 3: SLR(1) - Revision history

Root: /* Problem */

2024-05-02T09:39:23Z

Problem

← Older revision		Revision as of 09:39, 2 May 2024
Line 2:		Line 2:
	= Problem =		= Problem =

	S ~~-> x A y \| x B y \| x A z~~		Initial symbol: '''S'''
	~~B -> k~~
	~~A -> w S \| k~~

	~~Initial symbol~~: S		Terminals: '''{ k, w, x, y, z }'''

	~~Terminals~~: ~~{ k, w, x, y, z }~~		Input: '''xwxkyy'''

	~~Input: xwxkyy~~		S → x A y \| x B y \| x A z
			B → k
			A → w S \| k

	Is this an SLR(1) grammar?		Is this an SLR(1) grammar?

			Derive the SLR(1) parser for this grammar. Compact the parse table.
			Describe the processing of the input string by the compacted parser.

	== Solution ==		== Solution ==

Root at 14:27, 6 April 2015

2015-04-06T14:27:10Z

← Older revision		Revision as of 14:27, 6 April 2015
Line 16:		Line 16:
	== Solution ==		== Solution ==

	[[category:~~Teaching~~]]		[[category:Compiladores]]
	[[category:~~Compilers~~]]		[[category:Ensino]]

Root: /* Problem */

2011-05-16T15:18:56Z

Problem

← Older revision		Revision as of 15:18, 16 May 2011
Line 4:		Line 4:
	S -> x A y \| x B y \| x A z		S -> x A y \| x B y \| x A z
	B -> k		B -> k
	A w S \| k		A -> w S \| k

	Initial symbol: S		Initial symbol: S

Root: /* Problem */

2011-05-16T15:16:33Z

Problem

← Older revision		Revision as of 15:16, 16 May 2011
Line 11:		Line 11:

	Input: xwxkyy		Input: xwxkyy

			Is this an SLR(1) grammar?

	== Solution ==		== Solution ==

Root: /* Problem */

2011-05-16T15:15:07Z

Problem

← Older revision		Revision as of 15:15, 16 May 2011
Line 9:		Line 9:

	Terminals: { k, w, x, y, z }		Terminals: { k, w, x, y, z }

			Input: xwxkyy

	== Solution ==		== Solution ==

Root: 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..."

2011-05-16T15:14:50Z

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

New page

{{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:Compilers]]