Commit 15433c74 authored by Francis Dupont's avatar Francis Dupont
Browse files

[5112] spelling

parent 495bca03
...@@ -36,7 +36,7 @@ etc. This step took the tree generated in the earlier step, parsed it and ...@@ -36,7 +36,7 @@ etc. This step took the tree generated in the earlier step, parsed it and
generated output configuration (e.g. @ref isc::dhcp::SrvConfig) or dynamic generated output configuration (e.g. @ref isc::dhcp::SrvConfig) or dynamic
structures (e.g. isc::data::Host). There were a large number of parser objects structures (e.g. isc::data::Host). There were a large number of parser objects
derived from @ref isc::dhcp::DhcpConfigParser) instantiated for each scope and derived from @ref isc::dhcp::DhcpConfigParser) instantiated for each scope and
isntance of data (e.g. to parse 1000 host reservation entries a thousand of instance of data (e.g. to parse 1000 host reservation entries a thousand of
dedicated parsers were created). For convenience, this step is called phase 2. dedicated parsers were created). For convenience, this step is called phase 2.
Other issues with the old parsers are discussed here: @ref dhcpv6ConfigParserBison Other issues with the old parsers are discussed here: @ref dhcpv6ConfigParserBison
...@@ -71,7 +71,7 @@ detailed description is available in the following sections): ...@@ -71,7 +71,7 @@ detailed description is available in the following sections):
Grammar and syntax are perhaps fancy words, but they simply define what is Grammar and syntax are perhaps fancy words, but they simply define what is
allowed and where. Bison grammar starts with a list of tokens. Those tokens allowed and where. Bison grammar starts with a list of tokens. Those tokens
are defined only by name ("here's the list of possible tokens that could are defined only by name ("here's the list of possible tokens that could
appear"). What consitutes a token is actually defined in the lexer. The appear"). What constitutes a token is actually defined in the lexer. The
grammar define how the incoming tokens are expected to fall into their grammar define how the incoming tokens are expected to fall into their
places together. Let's take an example of the following input text: places together. Let's take an example of the following input text:
@code @code
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment