A context-free grammar that derives the same word by different derivation trees, or equivalently by different derivation sequences. A familiar programming language example is:
where S and C stand for statement and condition. This grammar is ambiguous since the following compound statement
has two interpretations, corresponding with two derivation trees, as shown in the diagram. See also inherently ambiguous language.
Ambiguous grammar. Two derivation trees in an ambiguous grammar
- butex process
- Buthelezi, Chief Mangosuthu (1928)
- Butler, Joseph (1692–1752)
- Butler matrix
- Butlerov, Alexander Mikhailovich (1828–86)
- Butler, Richard Austen (1902–82)
- Butler, Samuel (1835–1902)
- Butler–Volmer equation
- butte
- buttercup
- butterflies
- butterfly
- Butterfly Cluster
- butterfly diagram
- butterfly effect
- Butterfly Nebula
- butterfly valve
- butterwort
- Butterworth filter
- button
- button mica capacitor
- buttress root
- butylene
- butyl group
- butyl rubber