Modile 2.4: Grammar Ambiguity

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/9

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering grammar parsing, parse tree structures, and the definition and resolution of ambiguity based on Module 2 - Topic 4.

Last updated 3:41 PM on 8/13/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

10 Terms

1
New cards

Parse Tree

A hierarchical derivation where leaf nodes are terminals and non-leaf nodes are non-terminals.

2
New cards

Terminals

The components of a grammar that occupy the leaf nodes of a parse tree.

3
New cards

Non-terminals

The components of a grammar that occupy the non-leaf nodes of a parse tree.

4
New cards

Parsing

A process which takes a sentence and breaks it into its component parts, deriving a parse tree using a tool called a parser.

5
New cards

Illegal Sentence

A sentence for which the parser cannot generate a parse tree.

6
New cards

Ambiguous Grammar

A grammar that generates a sentential form that has two or more distinct parse trees.

7
New cards

Scanner

A tool called during the parsing process to get tokens from the input stream.

8
New cards

Symbol Table

A structure where information about identifiers is added during the parsing process.

9
New cards

Error Recovery

The stage in parsing where the system reports an error, when found, and recovers from it.

10
New cards

Grammar Rewriting

The process of taking an ambiguous grammar and modifying it to be unambiguous while still generating the desired language.