Skip to content

Commit

Permalink
Found typos and additional whitespace (#256)
Browse files Browse the repository at this point in the history
🤗
  • Loading branch information
j-mie6 authored Feb 11, 2025
2 parents ea44699 + 8bc7220 commit 145ec6b
Show file tree
Hide file tree
Showing 5 changed files with 6 additions and 6 deletions.
2 changes: 1 addition & 1 deletion docs/api-guide/expr/precedence.md
Original file line number Diff line number Diff line change
Expand Up @@ -142,7 +142,7 @@ object GOps {
}
```

The `SOps` object allows the input and output to the layer to vary so long as they are in a sub-type relation: this is the most common form of heterogeneous hierachy that leverages Scala's strengths. Otherwise, `GOps` handles any arbitrary relationship between the types, so long as there is a known implicit `A => B` conversion.
The `SOps` object allows the input and output to the layer to vary so long as they are in a sub-type relation: this is the most common form of heterogeneous hierarchy that leverages Scala's strengths. Otherwise, `GOps` handles any arbitrary relationship between the types, so long as there is a known implicit `A => B` conversion.

Since the types between layers differ, a variadic argument list cannot be used to collect them together. Instead, the `Ops` are
stitched together into a `Prec[A]` structure:
Expand Down
2 changes: 1 addition & 1 deletion parsley/js/rootdoc.md
Original file line number Diff line number Diff line change
Expand Up @@ -29,7 +29,7 @@ is defined as being an object which mocks a package):
to use character and string literals as parsers.
- [[parsley.syntax.lift$ `parsley.syntax.lift`]] enables postfix application of the lift
combinator onto a function (or value).
- [[parsley.syntax.zipped$ `parsley.syntax.zipped`]] enables boths a reversed form of
- [[parsley.syntax.zipped$ `parsley.syntax.zipped`]] enables both a reversed form of
lift where the function appears on the right and is applied on a tuple (useful when type
inference has failed) as well as a `.zipped` method for building tuples out of several
combinators.
Expand Down
4 changes: 2 additions & 2 deletions parsley/shared/src/main/scala/parsley/token/Lexer.scala
Original file line number Diff line number Diff line change
Expand Up @@ -431,7 +431,7 @@ final class Lexer(desc: descriptions.LexicalDesc, errConfig: errors.ErrorConfig)
def semiSep[A](p: Parsley[A]): Parsley[List[A]] = sepBy(p, symbol.semi)
/** This combinator parses '''one''' or more occurrences of `p`, separated by semi-colons.
*
* First parses a `p`. Then parses a semi-colon followed by `p` until there are no more semi-colons.
* First parses a `p`. Then parses a semi-colon followed by `p` until there are no more semi-colons.
* The results of the `p`'s, `x,,1,,` through `x,,n,,`, are returned as `List(x,,1,,, .., x,,n,,)`.
* If `p` fails having consumed input, the whole parser fails. Requires at least
* one `p` to have been parsed.
Expand Down Expand Up @@ -480,7 +480,7 @@ final class Lexer(desc: descriptions.LexicalDesc, errConfig: errors.ErrorConfig)
def commaSep[A](p: Parsley[A]): Parsley[List[A]] = sepBy(p, symbol.comma)
/** This combinator parses '''one''' or more occurrences of `p`, separated by commas.
*
* First parses a `p`. Then parses a comma followed by `p` until there are no more commas.
* First parses a `p`. Then parses a comma followed by `p` until there are no more commas.
* The results of the `p`'s, `x,,1,,` through `x,,n,,`, are returned as `List(x,,1,,, .., x,,n,,)`.
* If `p` fails having consumed input, the whole parser fails. Requires at least
* one `p` to have been parsed.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ private [token] final class LexemeCombined(combined: CombinedParsers, lexeme: Le
override lazy val hexadecimal: Parsley[Either[BigInt,BigDecimal]] = lexeme(combined.hexadecimal)
override lazy val octal: Parsley[Either[BigInt,BigDecimal]] = lexeme(combined.octal)
override lazy val binary: Parsley[Either[BigInt,BigDecimal]] = lexeme(combined.binary)
override lazy val number: Parsley[Either[BigInt,BigDecimal]] = lexeme(combined.number)
override lazy val number: Parsley[Either[BigInt,BigDecimal]] = lexeme(combined.number)

override protected[numeric] def bounded[T](number: Parsley[Either[BigInt,BigDecimal]], bits: Bits, radix: Int)
(implicit ev: CanHold[bits.self,T]): Parsley[Either[T, BigDecimal]] =
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ private [token] final class LexemeInteger(integer: IntegerParsers, lexeme: Lexem
override lazy val hexadecimal: Parsley[BigInt] = lexeme(integer.hexadecimal)
override lazy val octal: Parsley[BigInt] = lexeme(integer.octal)
override lazy val binary: Parsley[BigInt] = lexeme(integer.binary)
override lazy val number: Parsley[BigInt] = lexeme(integer.number)
override lazy val number: Parsley[BigInt] = lexeme(integer.number)

override protected[numeric] def bounded[T](number: Parsley[BigInt], bits: Bits, radix: Int, label: (ErrorConfig, Boolean) => LabelWithExplainConfig)
(implicit ev: CanHold[bits.self,T]): Parsley[T] =
Expand Down

0 comments on commit 145ec6b

Please sign in to comment.