Escape a word.

git-svn-id: https://svn.dealii.org/trunk@20604 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/examples/step-5/doc/intro.dox b/deal.II/examples/step-5/doc/intro.dox
index 43e24bfd9717eea1cec27e71a4b36cd9f4a4bb55..251d677560a311db44e9a6fc2ec352b6f9ed9b4d 100644 (file)
--- a/deal.II/examples/step-5/doc/intro.dox
+++ b/deal.II/examples/step-5/doc/intro.dox
@@ -16,7 +16,7 @@ them are:
        algorithms where iterative solution on successively refined
        grids is at the heart of algorithms. Although adaptive grids
        are not used in this example, the foundations for them is laid
-       here. 
+       here.
   <li> In practical applications, the domains are often subdivided
        into triangulations by automatic mesh generators. In order to
        use them, it is important to read coarse grids from a file. In
@@ -28,7 +28,7 @@ them are:
   <li> On the other side, finite element programs tend to be rather
        complex, so debugging is an important aspect. We support safe
        programming by using assertions that check the validity of
-       parameters and internal states in a debug mode, but are removed
+       parameters and %internal states in a debug mode, but are removed
        in optimized mode.
   <li> Regarding the mathematical side, we show how to support a
        variable coefficient in the elliptic operator and how to use