From beba017631f6188b8dab12a485beda94d2437935 Mon Sep 17 00:00:00 2001 From: Jack Firth Date: Sat, 2 Apr 2022 19:26:21 -0700 Subject: [PATCH] Fix a typo --- grammar.rkt | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/grammar.rkt b/grammar.rkt index 0f27d24..9973ffa 100644 --- a/grammar.rkt +++ b/grammar.rkt @@ -15,12 +15,15 @@ rackunit)) +;@---------------------------------------------------------------------------------------------------- + + ;; Parsing takes a (Grammar T S L) and a sequence of (Token T V) and produces a set of ;; (Parser-Derivation V L) (also called a "parse forest"). A grammar contains an immutable ;; vector of (Context-Free-Production-Rule T S L) and a start symbol of type S. ;; T: the terminals the grammar parses. Corresponds to the type field of the input tokens. ;; S: the nonterminals the grammar rules are defined in terms of. -;; L: the lables that grammar rules may have attached to them. These show up in parse tree +;; L: the labels that grammar rules may have attached to them. These show up in parse tree ;; branches, and can be used to determine which production rule produced a derivation. (struct context-free-grammar (rules start-symbol) #:transparent)