[llvm] r253167 - [Docs] Fix typo

[Alex Denisov via llvm-commits]

Author: alexdenisov
Date: Sun Nov 15 08:13:24 2015
New Revision: 253167

URL: http://llvm.org/viewvc/llvm-project?rev=253167&view=rev
Log:
[Docs] Fix typo

Modified:
    llvm/trunk/docs/tutorial/LangImpl2.rst
    llvm/trunk/docs/tutorial/OCamlLangImpl2.rst

Modified: llvm/trunk/docs/tutorial/LangImpl2.rst
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/docs/tutorial/LangImpl2.rst?rev=253167&r1=253166&r2=253167&view=diff
==============================================================================
--- llvm/trunk/docs/tutorial/LangImpl2.rst (original)
+++ llvm/trunk/docs/tutorial/LangImpl2.rst Sun Nov 15 08:13:24 2015
@@ -396,7 +396,7 @@ would be easy enough to eliminate the ma
 With the helper above defined, we can now start parsing binary
 expressions. The basic idea of operator precedence parsing is to break
 down an expression with potentially ambiguous binary operators into
-pieces. Consider ,for example, the expression "a+b+(c+d)\*e\*f+g".
+pieces. Consider, for example, the expression "a+b+(c+d)\*e\*f+g".
 Operator precedence parsing considers this as a stream of primary
 expressions separated by binary operators. As such, it will first parse
 the leading primary expression "a", then it will see the pairs [+, b]

Modified: llvm/trunk/docs/tutorial/OCamlLangImpl2.rst
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/docs/tutorial/OCamlLangImpl2.rst?rev=253167&r1=253166&r2=253167&view=diff
==============================================================================
--- llvm/trunk/docs/tutorial/OCamlLangImpl2.rst (original)
+++ llvm/trunk/docs/tutorial/OCamlLangImpl2.rst Sun Nov 15 08:13:24 2015
@@ -280,7 +280,7 @@ fixed-size array).
 With the helper above defined, we can now start parsing binary
 expressions. The basic idea of operator precedence parsing is to break
 down an expression with potentially ambiguous binary operators into
-pieces. Consider ,for example, the expression "a+b+(c+d)\*e\*f+g".
+pieces. Consider, for example, the expression "a+b+(c+d)\*e\*f+g".
 Operator precedence parsing considers this as a stream of primary
 expressions separated by binary operators. As such, it will first parse
 the leading primary expression "a", then it will see the pairs [+, b]