Noun article fixes in docs and comments

Author: moregan

lib/PPI/Lexer.pm

@@ -292,7 +292,7 @@ sub _lex_document {
 		# Is this the close of a structure.
 		if ( $Token->__LEXER__closes ) {
 			# Because we are at the top of the tree, this is an error.
-			# This means either a mis-parsing, or an mistake in the code.
+			# This means either a mis-parsing, or a mistake in the code.
 			# To handle this, we create a "Naked Close" statement
 			$self->_add_element( $Document,
 				PPI::Statement::UnmatchedBrace->new($Token)
@@ -1350,7 +1350,7 @@ sub _get_token {
 #     $self->{Tokenizer}->get_token;
 # }
 
-# Delay the addition of a insignificant elements.
+# Delay the addition of insignificant elements.
 # This ended up being inlined.
 # sub _delay_element {
 #     my $self    = shift;

lib/PPI/Statement/End.pm

@@ -12,7 +12,7 @@ PPI::Statement::End - Content after the __END__ of a module
   
   __END__
   
-  This is part of an PPI::Statement::End statement
+  This is part of a PPI::Statement::End statement
   
   =pod
   

lib/PPI/Token/Structure.pm

@@ -177,7 +177,7 @@ sub previous_token {
 		# Anything that slips through to here is a structure
 		# with a closing brace, but no opening brace, so we
 		# just have to go with it, and continue as we would
-		# if we started with a opening brace.
+		# if we started with an opening brace.
 	}
 
 	# We can use the default implement, if we call it from the

lib/PPI/Token/Whitespace.pm

@@ -247,7 +247,7 @@ sub __TOKENIZER__on_char {
 				return 'Prototype';
 			}
 
-			# An prototyped anonymous subroutine
+			# A prototyped anonymous subroutine
 			my $p0 = $tokens->[0];
 			if ( $p0->isa('PPI::Token::Word') and $p0->content eq 'sub'
 				# Maybe it's invoking a method named 'sub'

lib/PPI/Tokenizer.pm

@@ -889,7 +889,7 @@ called in whatever token class we are currently in, which will examine the
 character at the current position, and handle it.
 
 As the handler methods in the various token classes are called, they
-build up a output token array for the source code.
+build up an output token array for the source code.
 
 Various parts of the Tokenizer use look-ahead, arbitrary-distance
 look-behind (although currently the maximum is three significant tokens),

lib/PPI/Transform.pm

@@ -123,7 +123,7 @@ sub document {
 
 The C<apply> method is used to apply the transform to something. The
 argument must be a L<PPI::Document>, or something which can be turned
-into a one and then be written back to again.
+into one and then be written back to again.
 
 Currently, this list is limited to a C<SCALAR> reference, although a
 handler registration process is available for you to add support for

t/04_element.t

@@ -261,7 +261,7 @@ SCOPE: {
 	my $start = $doc->first_token;
 	isa_ok( $start, 'PPI::Token::Structure' );
 	is( $start->content, '{', 'Got start token' );
-	is( $start->previous_sibling, '', '->previous_sibling for an start opening brace returns false' );
+	is( $start->previous_sibling, '', '->previous_sibling for a start opening brace returns false' );
 	my $braces = $doc->find_first( sub {
 		$_[1]->isa('PPI::Structure') and $_[1]->braces eq '()'
 		} );

t/ppi_token_operator.t

@@ -414,7 +414,7 @@ OPERATOR_X: {
 
 	# Exhaustively test when a preceding operator implies following
 	# 'x' is word not an operator. This detects the regression in
-	# which '$obj->x86_convert()' was being parsed as an the x
+	# which '$obj->x86_convert()' was being parsed as an x
 	# operator.
 	my %operators = (
 		%PPI::Token::Operator::OPERATOR,