Rephrase the paragraphs

Signed-off-by: Baiju Muthukadan <baiju.m.mail@gmail.com>

Author: baijum

concurrency.tex

@@ -316,9 +316,9 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter explained concurrency features of Go.  Based on your
-problem, you can choose channels or other synchronization techniques.
-This chapter covered goroutines and channels usage.  It covered
-Waitgroups, Select statement.  It also covered buffered channels,
-channel direction.  The chapter also touched upon \textit{sync.Once}
-function usage.
+This chapter explained how to use Go's concurrency features. You can choose
+channels or other synchronization techniques, depending on your problem. This
+chapter covered goroutines and how to use channels. It also covered Waitgroups
+and Select statements. Additionally, it covered buffered channels and channel
+direction. Finally, the chapter briefly discussed the \textit{sync.Once}
+function.

control-structures.tex

@@ -841,9 +841,22 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter introduced control structures available in Go except those related
-to concurrency. The \textit{if} control structure was covered first,
-then \textit{for} loop explained. The \textit{switch} cases was discussed later.
-Then \textit{defer} statement and finally \textit{goto} control structure was
-explained in detail. This chapter also briefly explained about accessing command
-line arguments from the program.
+This chapter explained the control structures available in Go, except those
+related to concurrency. The \textit{if} control structure was covered first, then the
+\textit{for} loop was explained. The \textit{switch} cases were discussed later. Then the
+\textit{defer} statement and finally, the \textit{goto} control structure was explained in
+detail. This chapter also briefly explained accessing command line arguments
+from the program.
+
+Control structures are used to control the flow of execution in a program. They
+allow you to execute code conditionally, repeatedly, or in a specific order.
+
+\begin{itemize}
+
+    \item The \textit{if} control structure is used to execute code if a condition is met.
+    \item The \textit{for} loop is used to execute code repeatedly until a condition is met.
+    \item The \textit{switch} statement is used to execute code based on the value of a variable.
+    \item The \textit{defer} statement is used to execute code after the current function has finished executing.
+    \item The \textit{goto} statement is used to jump to a specific label in the code.
+
+\end{itemize}

data-structures.tex

@@ -1072,11 +1072,20 @@ \subsection{Additional Exercises}
 \section*{Summary}
 
 This chapter introduced various data structures in Go. These data structures
-will be helpful for organizing data. The chapter started with a section about
-zero values. Then constants explained in detail including \textit{iota} keyword
-for defining incrementing constants. Next, the chapter briefly explained about
-arrays. Then slices, the more useful data structure built on top of array is
-explained. Then we looked at how to define custom data types using existing
-primitive types. The struct was introduced which is more useful to create custom
-data types. Pointer is also covered. The next chapter will explain more about
-functions and methods.
+help organize data in a way that makes it easier to use and understand. The
+chapter started with a section about zero values, which are values that are
+assigned to variables when they are declared but not initialized. Then,
+constants were explained in detail, including the \textit{iota} keyword, which
+can be used to define incrementing constants. Next, the chapter briefly
+explained arrays, which are data structures that can store a fixed number of
+elements of the same type. Then, slices were explained, which are more flexible
+data structures that can store a variable number of elements of the same type.
+Slices are built on top of arrays, and they inherit many of the same properties.
+Next, the chapter looked at how to define custom data types using existing
+primitive types. Custom data types can be used to group together related data
+and make it easier to work with. The struct was introduced as a way to define
+custom data types. Structs can be used to store a collection of related data
+items, such as the name, age, and address of a person. Pointers were also
+covered. Pointers are variables that store the address of another variable.
+Pointers can be used to access the value of another variable indirectly. The
+next chapter will explain more about functions and methods.

functions.tex

@@ -514,8 +514,28 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter explained all the major aspects of functions in Go.  The
-chapter covered how to send input parameters and return values.  It
-also explained about variadic function and anonymous function.  This
-chapter briefly also covered methods.  The next chapter will cover
-interfaces.  Along with that, we will learn more about methods.
+This chapter explained the main features of functions in Go. It covered how to
+send input parameters and receive return values. It also explained about
+variadic functions and anonymous functions. This chapter briefly covered
+methods. The next chapter will cover interfaces. Along with that, we will learn
+more about methods.
+
+Brief summary of key concepts introduced in this chapter:
+
+\begin{itemize}
+
+\item Functions are used to group together related code and make it easier to read and
+  understand. They can also be used to reuse code in different parts of a
+  program.
+
+\item Input parameters are values that are passed into a function when it is called.
+  Return values are values that are returned by a function when it finishes
+  executing.
+
+\item Variadic functions are functions that can accept a variable number of input
+  parameters. Anonymous functions are functions that are defined without a name.
+
+\item Methods are functions that are associated with a specific type. They can be used
+  to operate on objects of that type.
+
+\end{itemize}

io.tex

@@ -335,8 +335,7 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter discussed about various input/output related
-functionalities in Go.  The chapter explained using command line
-arguments and interactive input.  The chaptered using \textit{flag}
-package.  It also explained about various string formatting
-techniques.
+This chapter discussed the input/output (I/O) features of the Go programming
+language. It explained how to use command line arguments and interactive input,
+and how to use the \textit{flag} package to parse command line arguments. It
+also explained various string formatting techniques.

objects.tex

@@ -341,8 +341,28 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter explained the concept of interfaces and it's uses.
-Interface is an important concept in Go.  Understanding interfaces and
-properly using it makes the design robust.  The chapter covered empty
-interface.  Also, briefly explained about pointer receiver and its
-significance.  Type assertions and type switches are also explained.
+This chapter explained the concept of interfaces and their uses. Interfaces are
+an important concept in Go. Understanding interfaces and using them properly
+makes the design robust. The chapter covered the empty interface, pointer
+receivers, and type assertions and type switches.
+
+Brief summary of key concepts introduced in this chapter:
+
+\begin{itemize}
+
+\item An interface is a set of methods that a type must implement. A type that
+  implements an interface can be used anywhere an interface is expected. This
+  allows for greater flexibility and reusability in Go code.
+
+\item A pointer receiver is a method that takes a pointer to a struct as its receiver.
+  Pointer receivers are often used to modify the state of a struct.
+
+\item A type assertion is a way of checking the type of a value at runtime. Type
+  assertions can be used to ensure that a value is of a certain type before
+  using it.
+
+\item A type switch is a control flow statement that allows for different code to be
+  executed based on the type of a value. Type switches can be used to make code
+  more robust and easier to read.
+
+\end{itemize}

packages.tex

@@ -3,7 +3,7 @@
 \chapter{Packages}
 
 \begin{quote}
-\textit{A little copying is better than a little dependency.} --- Go Proverb
+\textit{A little copying is better than a little dependency.} --- Go Proverbs
 \end{quote}
 
 Go encourages and provides mechanisms for code reusability.  Packages
@@ -374,8 +374,10 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-This chapter explained the Go package in detail.  Package is one of
-building block of a reusable Go program.  This chapter explained about
-creating packages, documenting packages, and finally about publish
-packages.  The chapter also covered modules and its usage.  Finally it
-explained moving types across packages during refactoring.
+This chapter explained packages in Go programming. Packages are a collection of
+related Go source files that are compiled together to form a single unit. They
+are one of the building blocks of a reusable Go program. This chapter explained
+how to create packages, document packages, and publish packages. It also covered
+modules and their usage. Finally, it explained how to move types across packages
+during refactoring. By understanding packages, you can write more modular and
+reusable Go programs.

quickstart.tex

@@ -972,8 +972,8 @@ \subsection{Additional Exercises}
 
 \section*{Summary}
 
-We started with a hello world program and briefly explained it.  Then
-this chapter introduced few basic topics in Go programming language.
-We have covered Data Types, Variables, Comments, For Loop, Range
-Clause, If, Function, Operators, Slices, and Maps.  The next chapters
-will explain the fundamental concepts in more detail.
+We began with a "hello world" program and briefly explained it. This chapter
+then introduced a few basic topics in the Go programming language. We covered
+data types, variables, comments, for loops, range clauses, if statements,
+functions, operators, slices, and maps. The following chapters will explain the
+fundamental concepts in more detail.

sphinx/concurrency.rst

@@ -433,11 +433,12 @@ with a particular word.
 Summary
 -------
 
-This chapter explained concurrency features of Go. Based on your
-problem, you can choose channels or other synchronization techniques.
-This chapter covered goroutines and channels usage. It covered
-Waitgroups, Select statement. It also covered buffered channels, channel
-direction. The chapter also touched upon *sync.Once* function usage.
+This chapter explained how to use Go’s concurrency features. You can
+choose channels or other synchronization techniques, depending on your
+problem. This chapter covered goroutines and how to use channels. It
+also covered Waitgroups and Select statements. Additionally, it covered
+buffered channels and channel direction. Finally, the chapter briefly
+discussed the *sync.Once* function.
 
 .. [1]
    http://usingcsp.com

sphinx/control-structures.rst

@@ -929,9 +929,27 @@ by 2, 3, or 5.
 Summary
 -------
 
-This chapter introduced control structures available in Go except those
-related to concurrency. The *if* control structure was covered first,
-then *for* loop explained. The *switch* cases was discussed later. Then
-*defer* statement and finally *goto* control structure was explained in
-detail. This chapter also briefly explained about accessing command line
-arguments from the program.
+This chapter explained the control structures available in Go, except
+those related to concurrency. The *if* control structure was covered
+first, then the *for* loop was explained. The *switch* cases were
+discussed later. Then the *defer* statement and finally, the *goto*
+control structure was explained in detail. This chapter also briefly
+explained accessing command line arguments from the program.
+
+Control structures are used to control the flow of execution in a
+program. They allow you to execute code conditionally, repeatedly, or in
+a specific order.
+
+-  The *if* control structure is used to execute code if a condition is
+   met.
+
+-  The *for* loop is used to execute code repeatedly until a condition
+   is met.
+
+-  The *switch* statement is used to execute code based on the value of
+   a variable.
+
+-  The *defer* statement is used to execute code after the current
+   function has finished executing.
+
+-  The *goto* statement is used to jump to a specific label in the code.

sphinx/data-structures.rst

@@ -1238,12 +1238,22 @@ Summary
 -------
 
 This chapter introduced various data structures in Go. These data
-structures will be helpful for organizing data. The chapter started with
-a section about zero values. Then constants explained in detail
-including *iota* keyword for defining incrementing constants. Next, the
-chapter briefly explained about arrays. Then slices, the more useful
-data structure built on top of array is explained. Then we looked at how
-to define custom data types using existing primitive types. The struct
-was introduced which is more useful to create custom data types. Pointer
-is also covered. The next chapter will explain more about functions and
-methods.
+structures help organize data in a way that makes it easier to use and
+understand. The chapter started with a section about zero values, which
+are values that are assigned to variables when they are declared but not
+initialized. Then, constants were explained in detail, including the
+*iota* keyword, which can be used to define incrementing constants.
+Next, the chapter briefly explained arrays, which are data structures
+that can store a fixed number of elements of the same type. Then, slices
+were explained, which are more flexible data structures that can store a
+variable number of elements of the same type. Slices are built on top of
+arrays, and they inherit many of the same properties. Next, the chapter
+looked at how to define custom data types using existing primitive
+types. Custom data types can be used to group together related data and
+make it easier to work with. The struct was introduced as a way to
+define custom data types. Structs can be used to store a collection of
+related data items, such as the name, age, and address of a person.
+Pointers were also covered. Pointers are variables that store the
+address of another variable. Pointers can be used to access the value of
+another variable indirectly. The next chapter will explain more about
+functions and methods.

sphinx/functions.rst

@@ -518,8 +518,25 @@ perimeter of a circle.
 Summary
 -------
 
-This chapter explained all the major aspects of functions in Go. The
-chapter covered how to send input parameters and return values. It also
-explained about variadic function and anonymous function. This chapter
-briefly also covered methods. The next chapter will cover interfaces.
-Along with that, we will learn more about methods.
+This chapter explained the main features of functions in Go. It covered
+how to send input parameters and receive return values. It also
+explained about variadic functions and anonymous functions. This chapter
+briefly covered methods. The next chapter will cover interfaces. Along
+with that, we will learn more about methods.
+
+Brief summary of key concepts introduced in this chapter:
+
+-  Functions are used to group together related code and make it easier
+   to read and understand. They can also be used to reuse code in
+   different parts of a program.
+
+-  Input parameters are values that are passed into a function when it
+   is called. Return values are values that are returned by a function
+   when it finishes executing.
+
+-  Variadic functions are functions that can accept a variable number of
+   input parameters. Anonymous functions are functions that are defined
+   without a name.
+
+-  Methods are functions that are associated with a specific type. They
+   can be used to operate on objects of that type.

sphinx/io.rst

@@ -555,10 +555,10 @@ Use a struct like this to define the complex number:
 Summary
 -------
 
-This chapter discussed about various input/output related
-functionalities in Go. The chapter explained using command line
-arguments and interactive input. The chaptered using *flag* package. It
-also explained about various string formatting techniques.
+This chapter discussed the input/output (I/O) features of the Go
+programming language. It explained how to use command line arguments and
+interactive input, and how to use the *flag* package to parse command
+line arguments. It also explained various string formatting techniques.
 
 .. [1]
    https://en.wikipedia.org/wiki/File_descriptor

sphinx/objects.rst

@@ -373,8 +373,27 @@ data type. This is how the ``error`` interface is defined:
 Summary
 -------
 
-This chapter explained the concept of interfaces and it’s uses.
-Interface is an important concept in Go. Understanding interfaces and
-properly using it makes the design robust. The chapter covered empty
-interface. Also, briefly explained about pointer receiver and its
-significance. Type assertions and type switches are also explained.
+This chapter explained the concept of interfaces and their uses.
+Interfaces are an important concept in Go. Understanding interfaces and
+using them properly makes the design robust. The chapter covered the
+empty interface, pointer receivers, and type assertions and type
+switches.
+
+Brief summary of key concepts introduced in this chapter:
+
+-  An interface is a set of methods that a type must implement. A type
+   that implements an interface can be used anywhere an interface is
+   expected. This allows for greater flexibility and reusability in Go
+   code.
+
+-  A pointer receiver is a method that takes a pointer to a struct as
+   its receiver. Pointer receivers are often used to modify the state of
+   a struct.
+
+-  A type assertion is a way of checking the type of a value at runtime.
+   Type assertions can be used to ensure that a value is of a certain
+   type before using it.
+
+-  A type switch is a control flow statement that allows for different
+   code to be executed based on the type of a value. Type switches can
+   be used to make code more robust and easier to read.

sphinx/packages.rst

@@ -1,7 +1,7 @@
 Packages
 ========
 
-   *A little copying is better than a little dependency.* — Go Proverb
+   *A little copying is better than a little dependency.* — Go Proverbs
 
 Go encourages and provides mechanisms for code reusability. Packages are
 one of the building block for code reusability. We have seen other code
@@ -398,8 +398,11 @@ areas for circle, rectangle, and triangle.
 Summary
 -------
 
-This chapter explained the Go package in detail. Package is one of
-building block of a reusable Go program. This chapter explained about
-creating packages, documenting packages, and finally about publish
-packages. The chapter also covered modules and its usage. Finally it
-explained moving types across packages during refactoring.
+This chapter explained packages in Go programming. Packages are a
+collection of related Go source files that are compiled together to form
+a single unit. They are one of the building blocks of a reusable Go
+program. This chapter explained how to create packages, document
+packages, and publish packages. It also covered modules and their usage.
+Finally, it explained how to move types across packages during
+refactoring. By understanding packages, you can write more modular and
+reusable Go programs.

sphinx/quickstart.rst

@@ -978,8 +978,8 @@ can print the values.
 Summary
 -------
 
-We started with a hello world program and briefly explained it. Then
-this chapter introduced few basic topics in Go programming language. We
-have covered Data Types, Variables, Comments, For Loop, Range Clause,
-If, Function, Operators, Slices, and Maps. The next chapters will
-explain the fundamental concepts in more detail.
+We began with a "hello world" program and briefly explained it. This
+chapter then introduced a few basic topics in the Go programming
+language. We covered data types, variables, comments, for loops, range
+clauses, if statements, functions, operators, slices, and maps. The
+following chapters will explain the fundamental concepts in more detail.