diff --git a/textproc/peg/Makefile b/textproc/peg/Makefile
index 5d5e56334ea3..5b0e87949548 100644
--- a/textproc/peg/Makefile
+++ b/textproc/peg/Makefile
@@ -1,22 +1,22 @@
 PORTNAME=	peg
-DISTVERSION=	0.1.18
+DISTVERSION=	0.1.19
 CATEGORIES=	textproc
 MASTER_SITES=	https://www.piumarta.com/software/peg/
 
 MAINTAINER=	jrm@FreeBSD.org
 COMMENT=	Recursive-descent parser generators for C
 WWW=		https://www.piumarta.com/software/peg/
 
 LICENSE=	MIT
 
 USES=		gmake
 
 PLIST_FILES=	bin/leg \
 		bin/peg \
 		man/man1/peg.1.gz
 
 post-patch:
 	@${REINPLACE_CMD} -e 's,%%STAGEDIR%%,${STAGEDIR},g' \
 		-e 's,%%PREFIX%%,${PREFIX},g' ${WRKSRC}/Makefile
 
 .include <bsd.port.mk>
diff --git a/textproc/peg/distinfo b/textproc/peg/distinfo
index 09745daa3e9f..ede4998b7fb0 100644
--- a/textproc/peg/distinfo
+++ b/textproc/peg/distinfo
@@ -1,3 +1,3 @@
-TIMESTAMP = 1655934585
-SHA256 (peg-0.1.18.tar.gz) = 20193bdd673fc7487a38937e297fff08aa73751b633a086ac28c3b34890f9084
-SIZE (peg-0.1.18.tar.gz) = 57776
+TIMESTAMP = 1700573296
+SHA256 (peg-0.1.19.tar.gz) = 0013dd83a6739778445a64bced3d74b9f50c07553f86ea43333ae5fab5c2bbb4
+SIZE (peg-0.1.19.tar.gz) = 136241
diff --git a/textproc/peg/pkg-descr b/textproc/peg/pkg-descr
index 67ab5201bb9c..b4a072846042 100644
--- a/textproc/peg/pkg-descr
+++ b/textproc/peg/pkg-descr
@@ -1,15 +1,15 @@
 peg and leg are tools for generating recursive-descent parsers: programs
-that perform pattern matching on text.  They processes a Parsing
+that perform pattern matching on text.  They process a Parsing
 Expression Grammar (PEG) [Ford 2004] to produce a program that
 recognises legal sentences of that grammar.  peg processes PEGs written
 using the original syntax described by Ford; leg processes PEGs written
 using slightly different syntax and conventions that are intended to
 make it an attractive replacement for parsers built with lex and
 yacc.  Unlike lex and yacc, peg and leg support unlimited backtracking,
 provide ordered choice as a means for disambiguation, and can combine
 scanning (lexical analysis) and parsing (syntactic analysis) into a
 single activity.
 
 [Ford 2004] Bryan Ford, Parsing Expression Grammars: A Recognition-Based
 Syntactic Foundation. ACM SIGPLAN Symposium on Principles of Programming
 Languages (POPL), 2004.