generated from norskeld/serpent
-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat(combinators/attempt): add
attempt
combinator
- Loading branch information
Showing
6 changed files
with
150 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
--- | ||
title: 'attempt' | ||
kind: 'primitive' | ||
description: "attempt combinator applies parser without consuming any input. It doesn't care if parser succeeds or fails, it won't consume any input." | ||
--- | ||
|
||
# {{ $frontmatter.title }} <Primitive /> | ||
|
||
## Signature | ||
|
||
```ts | ||
function attempt<T>(parser: Parser<T>): Parser<T> | ||
``` | ||
|
||
## Description | ||
|
||
`attempt` combinator applies `parser` without consuming any input. It doesn't care if `parser` succeeds or fails, it won't consume any input. | ||
|
||
## Usage | ||
|
||
The example is the same as in the docs for [`lookahead` combinators][lookahead]. Notice how differs the output for the last failing case: `attempt` doesn't consume any input, i.e. it doesn't advance `pos`. | ||
|
||
```ts | ||
const Parser = sequence( | ||
takeLeft(string('hello'), whitespace()), | ||
lookahead(string('let')), | ||
string('lettuce') | ||
) | ||
``` | ||
|
||
::: tip Success | ||
```ts | ||
run(Parser).with('hello lettuce') | ||
{ | ||
isOk: true, | ||
pos: 13, | ||
value: [ 'hello', 'let', 'lettuce' ] | ||
} | ||
``` | ||
::: | ||
|
||
::: danger Failure | ||
```ts | ||
run(Parser).with('hello let') | ||
{ | ||
isOk: false, | ||
pos: 9, // [!code warning] | ||
expected: 'lettuce' | ||
} | ||
``` | ||
::: | ||
|
||
::: danger Failure | ||
```ts | ||
run(Parser).with('hello something') | ||
{ | ||
isOk: false, | ||
pos: 6, // [!code warning] | ||
expected: 'let' | ||
} | ||
``` | ||
::: | ||
|
||
<!-- Links. --> | ||
|
||
[lookahead]: ./lookahead |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
import { attempt, sequence, takeLeft } from '@combinators' | ||
import { string, whitespace } from '@parsers' | ||
import { run, should, describe, it } from '@testing' | ||
|
||
describe('attempt', () => { | ||
const parser = sequence( | ||
takeLeft(string('hello'), whitespace()), | ||
attempt(string('let')), | ||
string('lettuce') | ||
) | ||
|
||
it('should successfully attempt and return pos untouched', () => { | ||
const actual = run(parser, 'hello lettuce') | ||
|
||
should.beStrictEqual(actual, { | ||
isOk: true, | ||
pos: 13, | ||
value: ['hello', 'let', 'lettuce'] | ||
}) | ||
}) | ||
|
||
it('should correctly fail if placed before a failing parser (OOB check)', () => { | ||
const actual = run(parser, 'hello let') | ||
|
||
should.beStrictEqual(actual, { | ||
isOk: false, | ||
pos: 9, | ||
expected: 'lettuce' | ||
}) | ||
}) | ||
|
||
it('should correctly fail if given a failing parser (non-consuming check)', () => { | ||
const actual = run(parser, 'hello const') | ||
|
||
should.beStrictEqual(actual, { | ||
isOk: false, | ||
pos: 6, | ||
expected: 'let' | ||
}) | ||
}) | ||
}) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
import type { Parser } from '@types' | ||
|
||
/** | ||
* Applies `parser` without consuming any input. It doesn't care if `parser` succeeds or fails, it | ||
* won't consume any input. | ||
* | ||
* @param parser - Parser to apply | ||
* | ||
* @returns Result of `parser` | ||
*/ | ||
export function attempt<T>(parser: Parser<T>): Parser<T> { | ||
return { | ||
parse(input, pos) { | ||
const result = parser.parse(input, pos) | ||
|
||
switch (result.isOk) { | ||
// If parser succeeded, keep the position untouched. | ||
case true: { | ||
return { | ||
isOk: true, | ||
pos, | ||
value: result.value | ||
} | ||
} | ||
|
||
// If parser failed, keep the position untouched as well. | ||
case false: { | ||
return { | ||
isOk: false, | ||
pos, | ||
expected: result.expected | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} |
7133746
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Successfully deployed to the following URLs:
sigma – ./
sigma-pearl.vercel.app
sigma-norskeld.vercel.app
sigma-git-master-norskeld.vercel.app
sigma.vm.codes