├── .github └── workflows │ └── test.yml ├── .gitignore ├── LICENSE ├── README.md ├── gleam.toml ├── rebar.config ├── rebar.lock ├── src ├── gleam_parser.app.src ├── gleam_parser.gleam └── rttl_parser.gleam └── test ├── gleam_parser_test.gleam └── rttl_parser_test.gleam /.github/workflows/test.yml: -------------------------------------------------------------------------------- 1 | name: test 2 | 3 | on: 4 | push: 5 | branches: 6 | - master 7 | - main 8 | pull_request: 9 | 10 | jobs: 11 | test: 12 | runs-on: ubuntu-latest 13 | steps: 14 | - uses: actions/checkout@v2.0.0 15 | - uses: gleam-lang/setup-erlang@v1.1.2 16 | with: 17 | otp-version: 23.2 18 | - uses: gleam-lang/setup-gleam@v1.0.2 19 | with: 20 | gleam-version: 0.14.3 21 | - run: rebar3 install_deps 22 | - run: rebar3 eunit 23 | - run: gleam format --check src test 24 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.beam 2 | *.iml 3 | *.o 4 | *.plt 5 | *.swo 6 | *.swp 7 | *~ 8 | .erlang.cookie 9 | .eunit 10 | .idea 11 | .rebar 12 | .rebar3 13 | _* 14 | _build 15 | docs 16 | ebin 17 | erl_crash.dump 18 | gen 19 | log 20 | logs 21 | rebar3.crashdump 22 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | Copyright {{copyright_year}}, {{author_name}} <{{author_email}}>. 179 | 180 | Licensed under the Apache License, Version 2.0 (the "License"); 181 | you may not use this file except in compliance with the License. 182 | You may obtain a copy of the License at 183 | 184 | http://www.apache.org/licenses/LICENSE-2.0 185 | 186 | Unless required by applicable law or agreed to in writing, software 187 | distributed under the License is distributed on an "AS IS" BASIS, 188 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 189 | See the License for the specific language governing permissions and 190 | limitations under the License. 191 | 192 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # gleam_parser 2 | 3 | A Gleam program 4 | 5 | 6 | ## Quick start 7 | 8 | ```sh 9 | # Build the project 10 | rebar3 compile 11 | 12 | # Run the eunit tests 13 | rebar3 eunit 14 | 15 | # Run the Erlang REPL 16 | rebar3 shell 17 | ``` 18 | 19 | 20 | ## Installation 21 | 22 | If [available in Hex](https://www.rebar3.org/docs/dependencies#section-declaring-dependencies) 23 | this package can be installed by adding `gleam_parser` to your `rebar.config` dependencies: 24 | 25 | ```erlang 26 | {deps, [ 27 | gleam_parser 28 | ]}. 29 | ``` 30 | -------------------------------------------------------------------------------- /gleam.toml: -------------------------------------------------------------------------------- 1 | name = "gleam_parser" 2 | 3 | # [docs] 4 | # links = [ 5 | # { title = 'GitHub', href = 'https://github.com/username/project_name' } 6 | # ] 7 | -------------------------------------------------------------------------------- /rebar.config: -------------------------------------------------------------------------------- 1 | {erl_opts, [debug_info]}. 2 | {src_dirs, ["src", "gen/src"]}. 3 | 4 | {profiles, [ 5 | {test, [{src_dirs, ["src", "test", "gen/src", "gen/test"]}]} 6 | ]}. 7 | 8 | {project_plugins, [rebar_gleam]}. 9 | 10 | {deps, [ 11 | {gleam_stdlib, "0.14.0"} 12 | ]}. 13 | -------------------------------------------------------------------------------- /rebar.lock: -------------------------------------------------------------------------------- 1 | {"1.2.0", 2 | [{<<"gleam_stdlib">>,{pkg,<<"gleam_stdlib">>,<<"0.14.0">>},0}]}. 3 | [ 4 | {pkg_hash,[ 5 | {<<"gleam_stdlib">>, <<"765D90AC06F97D7A8E8F7AC4BEDA373879D98C78A27FD8DEACC98AA34DA2DDCE">>}]}, 6 | {pkg_hash_ext,[ 7 | {<<"gleam_stdlib">>, <<"9107F6A859CB96945AD9A099085DB028CA2BEBB3C8EA42EEC227B51C614CC2E0">>}]} 8 | ]. 9 | -------------------------------------------------------------------------------- /src/gleam_parser.app.src: -------------------------------------------------------------------------------- 1 | {application, gleam_parser, 2 | [{description, "A Gleam program"}, 3 | {vsn, "1.0.0"}, 4 | {registered, []}, 5 | {applications, 6 | [kernel, 7 | stdlib, 8 | gleam_stdlib 9 | ]}, 10 | {env,[]}, 11 | {modules, []}, 12 | 13 | {include_files, ["gleam.toml", "gen"]}, 14 | {licenses, ["Apache 2.0"]}, 15 | {links, []} 16 | ]}. 17 | -------------------------------------------------------------------------------- /src/gleam_parser.gleam: -------------------------------------------------------------------------------- 1 | import gleam/pair 2 | import gleam/string 3 | import gleam/list.{Continue, Stop} 4 | import gleam/int 5 | import gleam/float 6 | import gleam/option.{None, Option, Some} 7 | 8 | pub type State { 9 | State(input: List(String), row: Int, col: Int) 10 | } 11 | 12 | pub type Parser(a) { 13 | Parser(fn(State) -> tuple(State, Result(a, List(DeadEnd)))) 14 | } 15 | 16 | pub type DeadEnd { 17 | DeadEnd(row: Int, col: Int, problem: Problem) 18 | } 19 | 20 | pub type Problem { 21 | ExpectingSymbol(symbol: String) 22 | ExpectingInt 23 | } 24 | 25 | fn to_dead_end(state: State, problem: Problem) -> DeadEnd { 26 | DeadEnd(row: state.row, col: state.col, problem: problem) 27 | } 28 | 29 | pub fn run(parser: Parser(a), input: String) -> Result(a, List(DeadEnd)) { 30 | let Parser(parse) = parser 31 | let input_graphemes = string.to_graphemes(input) 32 | 33 | State(input: input_graphemes, row: 1, col: 1) 34 | |> parse() 35 | |> pair.second() 36 | } 37 | 38 | pub fn symbol(needle: String) -> Parser(Nil) { 39 | let needle_length = string.length(needle) 40 | let needle_graphemes = string.to_graphemes(needle) 41 | 42 | Parser(fn(state: State) { 43 | case list.take(state.input, needle_length) == needle_graphemes { 44 | True -> tuple( 45 | State( 46 | ..state, 47 | input: list.drop(state.input, needle_length), 48 | col: state.col + needle_length, 49 | ), 50 | Ok(Nil), 51 | ) 52 | _ -> tuple(state, Error([to_dead_end(state, ExpectingSymbol(needle))])) 53 | } 54 | }) 55 | } 56 | 57 | pub fn int() -> Parser(Int) { 58 | Parser(fn(state: State) { 59 | let digits = 60 | state.input 61 | |> list.fold_until( 62 | [], 63 | fn(el, acc) { 64 | case el { 65 | "0" -> Continue([0, ..acc]) 66 | "1" -> Continue([1, ..acc]) 67 | "2" -> Continue([2, ..acc]) 68 | "3" -> Continue([3, ..acc]) 69 | "4" -> Continue([4, ..acc]) 70 | "5" -> Continue([5, ..acc]) 71 | "6" -> Continue([6, ..acc]) 72 | "7" -> Continue([7, ..acc]) 73 | "8" -> Continue([8, ..acc]) 74 | "9" -> Continue([9, ..acc]) 75 | "." -> Stop([]) 76 | _ -> Stop(acc) 77 | } 78 | }, 79 | ) 80 | case digits { 81 | [] -> tuple(state, Error([to_dead_end(state, ExpectingInt)])) 82 | _ -> { 83 | let rest = list.drop(state.input, list.length(digits)) 84 | let return_value = 85 | digits 86 | |> list.index_fold( 87 | 0, 88 | fn(index, item, acc) { 89 | let factor = float.round(float.power(10.0, int.to_float(index))) 90 | item * factor + acc 91 | }, 92 | ) 93 | tuple( 94 | State(..state, input: rest, col: state.col + list.length(digits)), 95 | Ok(return_value), 96 | ) 97 | } 98 | } 99 | }) 100 | } 101 | 102 | // combinator building blocks 103 | pub fn succeed(value: a) -> Parser(a) { 104 | Parser(fn(state) { tuple(state, Ok(value)) }) 105 | } 106 | 107 | pub fn keep(mapper: Parser(fn(a) -> b), first: Parser(a)) -> Parser(b) { 108 | map2(mapper, first, fn(a, b) { a(b) }) 109 | } 110 | 111 | pub fn leave(keep: Parser(a), leave: Parser(b)) -> Parser(a) { 112 | map2(keep, leave, fn(a, _) { a }) 113 | } 114 | 115 | // map over a parser 116 | pub fn map(parser: Parser(a), map_fun: fn(a) -> b) -> Parser(b) { 117 | let Parser(parse) = parser 118 | 119 | Parser(fn(state: State) { 120 | let result = parse(state) 121 | case result.1 { 122 | Ok(value) -> tuple(result.0, Ok(map_fun(value))) 123 | Error(errs) -> tuple(state, Error(errs)) 124 | } 125 | }) 126 | } 127 | 128 | // chain two parsers together 129 | pub fn map2( 130 | a_parser: Parser(a), 131 | b_parser: Parser(b), 132 | map_fun: fn(a, b) -> value, 133 | ) -> Parser(value) { 134 | let Parser(parse_a) = a_parser 135 | let Parser(parse_b) = b_parser 136 | 137 | Parser(fn(state: State) { 138 | let parse_a_result = parse_a(state) 139 | case parse_a_result.1 { 140 | Ok(a_value) -> { 141 | let parse_b_result = parse_b(parse_a_result.0) 142 | case parse_b_result.1 { 143 | Ok(b_value) -> tuple(parse_b_result.0, Ok(map_fun(a_value, b_value))) 144 | Error(errs) -> tuple(state, Error(errs)) 145 | } 146 | } 147 | 148 | Error(errs) -> tuple(state, Error(errs)) 149 | } 150 | }) 151 | } 152 | 153 | type OneOfState(a) { 154 | OneOfState(new_state: State, result: Option(a), errs: List(DeadEnd)) 155 | } 156 | 157 | // decide between multiple parsers 158 | pub fn one_of(parsers: List(Parser(a))) -> Parser(a) { 159 | Parser(fn(state: State) { 160 | let initial_state = OneOfState(new_state: state, result: None, errs: []) 161 | 162 | let final_state = 163 | parsers 164 | |> list.fold_until( 165 | initial_state, 166 | fn(parser: Parser(a), acc: OneOfState(a)) { 167 | let Parser(parse) = parser 168 | let result = parse(state) 169 | 170 | case result.1 { 171 | Ok(value) -> 172 | Stop(OneOfState( 173 | new_state: result.0, 174 | result: Some(value), 175 | errs: [], 176 | )) 177 | Error(errs) -> 178 | Continue(OneOfState( 179 | new_state: state, 180 | result: None, 181 | errs: list.append(acc.errs, errs), 182 | )) 183 | } 184 | }, 185 | ) 186 | 187 | case final_state.result { 188 | Some(result) -> tuple(final_state.new_state, Ok(result)) 189 | None -> tuple(state, Error(final_state.errs)) 190 | } 191 | }) 192 | } 193 | -------------------------------------------------------------------------------- /src/rttl_parser.gleam: -------------------------------------------------------------------------------- 1 | import gleam_parser.{Parser} as p 2 | import gleam/function 3 | 4 | pub type Note { 5 | A 6 | Bb 7 | B 8 | C 9 | Db 10 | D 11 | Eb 12 | E 13 | F 14 | Gb 15 | G 16 | Ab 17 | } 18 | 19 | pub type Pitch { 20 | Pitch(note: Note, octave: Int) 21 | } 22 | 23 | pub type DurationLength { 24 | Whole 25 | Half 26 | Quarter 27 | Eighth 28 | Sixteenth 29 | ThirtySecond 30 | } 31 | 32 | pub type Duration { 33 | Normal(length: DurationLength) 34 | Dotted(length: DurationLength) 35 | } 36 | 37 | pub type Tone { 38 | Tone(duration: Duration, pitch: Pitch) 39 | Pause(duration: Duration) 40 | } 41 | 42 | pub fn with_sharp(note: String, current: Note, sharped: Note) -> Parser(Note) { 43 | p.one_of([ 44 | p.succeed(sharped) 45 | |> p.leave(p.symbol("#")) 46 | |> p.leave(p.symbol(note)), 47 | p.succeed(current) 48 | |> p.leave(p.symbol(note)), 49 | ]) 50 | } 51 | 52 | pub fn note_parser() -> Parser(Note) { 53 | p.one_of([ 54 | with_sharp("a", A, Bb), 55 | with_sharp("b", B, C), 56 | with_sharp("c", C, Db), 57 | with_sharp("d", D, Eb), 58 | with_sharp("e", E, F), 59 | with_sharp("f", F, Gb), 60 | with_sharp("g", G, Ab), 61 | ]) 62 | } 63 | 64 | pub fn octave_parser() -> Parser(Int) { 65 | p.one_of([ 66 | p.succeed(1) 67 | |> p.leave(p.symbol("1")), 68 | p.succeed(2) 69 | |> p.leave(p.symbol("2")), 70 | p.succeed(3) 71 | |> p.leave(p.symbol("3")), 72 | ]) 73 | } 74 | 75 | pub fn pitch_parser() -> Parser(Pitch) { 76 | p.succeed(function.curry2(Pitch)) 77 | |> p.keep(note_parser()) 78 | |> p.keep(octave_parser()) 79 | } 80 | 81 | pub fn duration_lenth_parser() -> Parser(DurationLength) { 82 | p.one_of([ 83 | p.succeed(ThirtySecond) 84 | |> p.leave(p.symbol("32")), 85 | p.succeed(Sixteenth) 86 | |> p.leave(p.symbol("16")), 87 | p.succeed(Sixteenth) 88 | |> p.leave(p.symbol("16")), 89 | p.succeed(Eighth) 90 | |> p.leave(p.symbol("8")), 91 | p.succeed(Quarter) 92 | |> p.leave(p.symbol("4")), 93 | p.succeed(Half) 94 | |> p.leave(p.symbol("2")), 95 | p.succeed(Whole) 96 | |> p.leave(p.symbol("1")), 97 | ]) 98 | } 99 | 100 | pub fn duration_parser() -> Parser(Duration) { 101 | p.one_of([ 102 | p.succeed(Dotted) 103 | |> p.keep(duration_lenth_parser()) 104 | |> p.leave(p.symbol(".")), 105 | p.succeed(Normal) 106 | |> p.keep(duration_lenth_parser()), 107 | ]) 108 | } 109 | 110 | pub fn tone_parser() -> Parser(Tone) { 111 | p.one_of([ 112 | p.succeed(function.curry2(Tone)) 113 | |> p.keep(duration_parser()) 114 | |> p.keep(pitch_parser()), 115 | p.succeed(Pause) 116 | |> p.keep(duration_parser()) 117 | |> p.leave(p.symbol("-")), 118 | ]) 119 | } 120 | -------------------------------------------------------------------------------- /test/gleam_parser_test.gleam: -------------------------------------------------------------------------------- 1 | import gleam_parser.{ExpectingInt, ExpectingSymbol} as p 2 | import gleam/should 3 | import gleam/int 4 | 5 | // SYMBOLS 6 | pub fn symbol_success_test() { 7 | p.run(p.symbol(","), ",") 8 | |> should.equal(Ok(Nil)) 9 | } 10 | 11 | pub fn symbol_multi_character_success_test() { 12 | p.run(p.symbol("foo"), "foobar") 13 | |> should.equal(Ok(Nil)) 14 | } 15 | 16 | pub fn symbol_failure_test() { 17 | p.run(p.symbol(","), ":") 18 | |> should.equal(Error([p.DeadEnd(1, 1, ExpectingSymbol(","))])) 19 | } 20 | 21 | pub fn symbol_empty_string_test() { 22 | p.run(p.symbol(","), "") 23 | |> should.equal(Error([p.DeadEnd(1, 1, ExpectingSymbol(","))])) 24 | } 25 | 26 | pub fn symbol_deadend_tracks_context_test() { 27 | let parser = 28 | p.symbol("foo") 29 | |> p.leave(p.symbol("bar")) 30 | 31 | p.run(parser, "foobar") 32 | |> should.equal(Ok(Nil)) 33 | 34 | p.run(parser, "foospam") 35 | |> should.equal(Error([p.DeadEnd(1, 4, ExpectingSymbol("bar"))])) 36 | } 37 | 38 | // INTS 39 | pub fn int_success_test() { 40 | p.run(p.int(), "100") 41 | |> should.equal(Ok(100)) 42 | } 43 | 44 | pub fn int_failure_test() { 45 | p.run(p.int(), "bar") 46 | |> should.equal(Error([p.DeadEnd(1, 1, ExpectingInt)])) 47 | } 48 | 49 | pub fn int_followed_by_period_failure_test() { 50 | p.run(p.int(), "100.") 51 | |> should.equal(Error([p.DeadEnd(1, 1, ExpectingInt)])) 52 | } 53 | 54 | pub fn int_deadend_tracks_context_test() { 55 | let parser = 56 | p.int() 57 | |> p.leave(p.symbol("bar")) 58 | 59 | p.run(parser, "100bar") 60 | |> should.equal(Ok(100)) 61 | 62 | p.run(parser, "100spam") 63 | |> should.equal(Error([p.DeadEnd(1, 4, ExpectingSymbol("bar"))])) 64 | } 65 | 66 | // COMBINATORS 67 | type IntResult { 68 | IntResult(int: Int) 69 | } 70 | 71 | pub fn discard_symbol_but_keep_int_test() { 72 | let parser = 73 | p.succeed(IntResult) 74 | |> p.leave(p.symbol("hi")) 75 | |> p.keep(p.int()) 76 | 77 | p.run(parser, "hi500") 78 | |> should.equal(Ok(IntResult(500))) 79 | } 80 | 81 | type FloatResult { 82 | FloatResult(float: Float) 83 | } 84 | 85 | pub fn map_over_parsing_success_test() { 86 | let parser = 87 | p.succeed(FloatResult) 88 | |> p.keep( 89 | p.int() 90 | |> p.map(int.to_float), 91 | ) 92 | 93 | p.run(parser, "100") 94 | |> should.equal(Ok(FloatResult(100.0))) 95 | 96 | p.run(parser, "foo") 97 | |> should.equal(Error([p.DeadEnd(1, 1, ExpectingInt)])) 98 | } 99 | 100 | // ONE OF 101 | pub fn one_of_test() { 102 | let parser = p.one_of([p.symbol("hi"), p.symbol("ha")]) 103 | 104 | p.run(parser, "hi") 105 | |> should.equal(Ok(Nil)) 106 | 107 | p.run(parser, "ha") 108 | |> should.equal(Ok(Nil)) 109 | 110 | p.run(parser, "ho") 111 | |> should.equal(Error([ 112 | p.DeadEnd(1, 1, ExpectingSymbol("hi")), 113 | p.DeadEnd(1, 1, ExpectingSymbol("ha")), 114 | ])) 115 | } 116 | -------------------------------------------------------------------------------- /test/rttl_parser_test.gleam: -------------------------------------------------------------------------------- 1 | import rttl_parser.{Dotted, F, Pitch, ThirtySecond, Tone} 2 | import gleam_parser as p 3 | import gleam/should 4 | 5 | pub fn rttl_test() { 6 | p.run(rttl_parser.tone_parser(), "32.f2") 7 | |> should.equal(Ok(Tone(pitch: Pitch(F, 2), duration: Dotted(ThirtySecond)))) 8 | } 9 | --------------------------------------------------------------------------------