From e4f85c39b2014362daede3a13600d6456c1b7504 Mon Sep 17 00:00:00 2001 From: Paul Eggert Date: Wed, 23 Feb 2005 09:15:09 +0000 Subject: [PATCH] (Language and Grammar): some -> same (Epilogue): int he -> in the --- doc/bison.texinfo | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/bison.texinfo b/doc/bison.texinfo index 0bf1c0da..6d7a81ec 100644 --- a/doc/bison.texinfo +++ b/doc/bison.texinfo @@ -444,7 +444,7 @@ roughly that the next grammar rule to apply at any point in the input is uniquely determined by the preceding input and a fixed, finite portion (called a @dfn{look-ahead}) of the remaining input. A context-free grammar can be @dfn{ambiguous}, meaning that there are multiple ways to -apply the grammar rules to get the some inputs. Even unambiguous +apply the grammar rules to get the same inputs. Even unambiguous grammars can be @dfn{non-deterministic}, meaning that no fixed look-ahead always suffices to determine the next grammar rule to apply. With the proper declarations, Bison is also able to parse these more @@ -2627,7 +2627,7 @@ not come before the definition of @code{yyparse}. For example, the definitions of @code{yylex} and @code{yyerror} often go here. Because C requires functions to be declared before being used, you often need to declare functions like @code{yylex} and @code{yyerror} in the Prologue, -even if you define them int he Epilogue. +even if you define them in the Epilogue. @xref{Interface, ,Parser C-Language Interface}. If the last section is empty, you may omit the @samp{%%} that separates it -- 2.45.2