[ { "path": ".github/workflows/ci.yml", "content": "on: \n push:\n pull_request:\n schedule: [cron: \"40 6 10 1/2 *\"]\n\nname: Tests\n\njobs:\n test:\n name: test\n runs-on: ubuntu-latest\n strategy:\n matrix:\n rust:\n - stable\n - nightly\n - 1.4.0\n steps:\n - uses: actions/checkout@v3\n - uses: actions-rs/toolchain@v1\n with:\n profile: minimal\n toolchain: ${{ matrix.rust }}\n override: true\n - uses: actions-rs/cargo@v1\n with:\n command: test\n\n" }, { "path": ".gitignore", "content": "/Cargo.lock\n/target/\n**/*.rs.bk\n" }, { "path": "Cargo.toml", "content": "[package]\nname = \"lang-c\"\nversion = \"0.15.1\"\nauthors = [\"Vickenty Fesunov \"]\nlicense = \"MIT/Apache-2.0\"\ndescription = \"Lightweight C parser\"\ninclude = [ \"/src/**/*.rs\", \"Cargo.toml\", \"/LICENSE*\", \"/README.md\" ]\ndocumentation = \"https://docs.rs/lang-c\"\nhomepage = \"https://github.com/vickenty/lang-c\"\nrepository = \"https://github.com/vickenty/lang-c\"\nkeywords = [ \"ast\", \"c\", \"parser\", \"c-language\" ]\ncategories = [ \"parser-implementations\" ]\n\n[features]\ndev-pegviz = [] # tests only: emit extra output for pegviz\n" }, { "path": "LICENSE-APACHE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\nTERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\nEND OF TERMS AND CONDITIONS\n\nAPPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\nCopyright [yyyy] [name of copyright owner]\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n\thttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n" }, { "path": "LICENSE-MIT", "content": "Permission is hereby granted, free of charge, to any\nperson obtaining a copy of this software and associated\ndocumentation files (the \"Software\"), to deal in the\nSoftware without restriction, including without\nlimitation the rights to use, copy, modify, merge,\npublish, distribute, sublicense, and/or sell copies of\nthe Software, and to permit persons to whom the Software\nis furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice\nshall be included in all copies or substantial portions\nof the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF\nANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\nTO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\nSHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR\nIN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n" }, { "path": "Makefile", "content": ".PHONY: all lib\n\npeg?=rust-peg\n\nall: src/parser.rs\n\tcargo b --lib --features '$(features)'\n\tcargo t --features '$(features)'\n\ntrace:\n\trm -f src/parser.rs\n\tmake peg=rust-peg-trace features=dev-pegviz\n\n.INTERMEDIATE: src/parser.rs.raw src/parser.rs.fmt\n\nsrc/parser.rs.raw: grammar.rustpeg grammar.rustfmt grammar.header\n\t$(peg) $< > $@\n\nsrc/parser.rs.fmt: src/parser.rs.raw\n\trustfmt --config-path grammar.rustfmt < $< > $@\n\nsrc/parser.rs: src/parser.rs.fmt\n\tcat grammar.header $< > $@\n\ncheck:\n\ttest src/parser.rs -nt grammar.rustpeg\n" }, { "path": "README.md", "content": "# Lang-C\n\n[![Documentation](https://docs.rs/lang-c/badge.svg)](https://docs.rs/lang-c)\n\nLigtweight parser of C language for Rust users. Almost full support for C11 revision of the language.\nSeveral GCC and Clang extensions are also supported as an option.\n\n```rust\nextern crate lang_c;\nuse lang_c::driver::{Config, parse}; \n\nfn main() {\n let config = Config::default();\n println!(\"{:?}\", parse(&config, \"example.c\"));\n}\n```\n\n# Bugs\n\nJust open an issue, bug reports and patches are most welcome. \n\n## License\n\nDual-licenced under Apache 2.0 or MIT licenses (see `LICENSE-APACHE` and `LICENSE-MIT` for legal terms).\n\n## Development\n\nA number of external tools are used during development:\n\n- GNU make\n- rustfmt\n- [rust-peg](https://github.com/kevinmehall/rust-peg) 0.5.4\n\nParser (`src/parser.rs`) is built from a PEG grammar in `grammar.rustpeg`. It is updated manually and then \ncommitted, not generated on every build, thus no `rust-peg` in the list of dependencies.\n\nFor debugging purposes, it is handy to have a version rust-peg built with tracing enabled.\n\nA makefile is used to script the development process:\n\n- `make` update parser, build the library and run the tests;\n- `make trace` rebuilds parser using `rust-peg-trace`, which is expected to be a version of `rust-peg` command with `trace` feature enabled\n- `make check` can be used as pre-commit git hook to make sure parser is up to date\n" }, { "path": "grammar.header", "content": "#![cfg_attr(rustfmt, rustfmt_skip)]\n#![allow(unknown_lints)]\n#![allow(ellipsis_inclusive_range_patterns)]\n" }, { "path": "grammar.rustfmt", "content": "max_width = 10000\ntab_spaces = 4\n" }, { "path": "grammar.rustpeg", "content": "// Written for peg 0.5.4\n\n#![arguments(env: &mut Env)]\n\nuse ast::*;\nuse astutil::*;\nuse env::{Env, Symbol};\nuse span::{Node, Span};\n\n////\n// Prologue\n////\n\nbox = e:ex { Box::new(e) }\n\nnode = l:#position e:ex r:#position { Node::new(e, Span::span(l, r)) }\n\n// Lists of elements.\nlist0 = e:ex ** _ { e }\nlist1 = e:ex ++ _ { e }\ncs0 = e:ex ** (_ \",\" _) { e }\ncs1 = e:ex ++ (_ \",\" _) { e }\n\n// A list containing 0+ before's, 1 single, and 0+ after's.\nlist_010 =\n before:list0 _ single:single _ after:list0 {\n let mut before = before;\n before.push(single);\n before.extend(after);\n before\n }\n// A list containing *exactly* one element of a, and any of b.\nlist_eq1_n = list_010\n// A list containing *at least* one element of a, and any of b.\nlist_ge1_n = list_010\n\n////\n// Whitespace\n////\n\n_ = #quiet<(\"\\r\"? \"\\n\" directive? / [ \\t])*>\n\ndirective = \"#\" [^\\n]*\n\n////\n// 6.4.1 Keywords\n////\n\nK = #quiet\n\n////\n// 6.4.2 Identifiers\n////\n\n// Identifiers.\nidentifier -> Node = node\n\nidentifier0 -> Identifier =\n n:$([_a-zA-Z] [_a-zA-Z0-9]*) {?\n if !env.reserved.contains(n) {\n Ok(Identifier {\n name: n.into(),\n })\n } else {\n Err(\"identifier\")\n }\n }\n\n////\n// 6.4.3 Universal character names\n////\n\n// TODO\n\n////\n// 6.4.4 Constants\n////\n\nohx = \"0\" [xX]\nobb = \"0\" [bB]\ndec = [0-9]\noct = [0-7]\nhex = [0-9a-fA-F]\nbin = [0-1]\n\npub constant -> Constant =\n &[0-9.] c:numeric_constant { c } /\n &['uUL] c:character_constant { Constant::Character(c) }\n\nnumeric_constant -> Constant =\n c:float_constant { Constant::Float(c) } /\n c:integer_constant { Constant::Integer(c) }\n\ninteger_constant -> Integer =\n n:integer_number suffix:integer_suffix {\n let (base, number) = n;\n Integer {\n base: base,\n number: number.to_owned().into_boxed_str(),\n suffix: suffix,\n }\n }\n\ninteger_number -> (IntegerBase, &'input str) =\n n:$([1-9] dec*) { (IntegerBase::Decimal, n) } /\n ohx n:$(hex+) { (IntegerBase::Hexadecimal, n) } /\n \"0\" n:$(oct+) { (IntegerBase::Octal, n) } /\n gnu /\n n:$(\"0\") { (IntegerBase::Decimal, n) }\n\ninteger_suffix -> IntegerSuffix =\n #quiet / #expected(\"integer suffix\")\n\ninteger_suffix_inner -> IntegerSuffix =\n s:$(([uUlL] / gnu<[iIjJ]>)*) {? int_suffix(s) }\n\nfloat_constant -> Float =\n n:float_number suffix:float_suffix {\n let (base, number) = n;\n Float {\n base: base,\n number: number.to_string().into_boxed_str(),\n suffix: suffix,\n }\n }\n\nfloat_number -> (FloatBase, &'input str) =\n n:$(float_decimal) { (FloatBase::Decimal, n) } /\n ohx n:$(float_hexadecimal) { (FloatBase::Hexadecimal, n) }\n\nfloat_decimal =\n dec* \".\" dec+ float_decimal_exp? /\n dec+ \".\" float_decimal_exp? /\n dec+ float_decimal_exp\n\nfloat_decimal_exp = [eE][+-]?dec+\n\nfloat_hexadecimal =\n hex* \".\" hex+ float_binary_exp /\n hex+ \".\" float_binary_exp /\n hex+ float_binary_exp\n\nfloat_binary_exp = [pP][+-]?dec+\n\nfloat_suffix -> FloatSuffix = #quiet / #expected(\"float literal suffix\")\n\nfloat_suffix_inner -> FloatSuffix =\n gnu<[iIjJ]> fmt:float_format {\n FloatSuffix {\n format: fmt,\n imaginary: true,\n }\n } /\n fmt:float_format imag:gnu<[iIjJ]>? {\n FloatSuffix {\n format: fmt,\n imaginary: imag.is_some(),\n }\n }\n\nfloat_format -> FloatFormat =\n f:ts18661_float_suffix { FloatFormat::TS18661Format(f) } /\n [fF] { FloatFormat::Float } /\n [lL] { FloatFormat::LongDouble } /\n { FloatFormat::Double }\n\ncharacter_constant -> String =\n c:$([LuU]? \"'\" character+ \"'\") { String::from(c) }\n\ncharacter = [^'\\\\\\n] / escape_sequence\n\nescape_sequence = \"\\\\\" (['\"?\\\\abfnrtv] / oct*<1,3> / \"x\" hex+)\n\n////\n// 6.4.5 String literal\n////\n\npub string_literal -> Node> = s:node> { s }\n\nstring_literal0 -> String =\n s:$(encoding_prefix? \"\\\"\" string_char* \"\\\"\") { String::from(s) }\n\nencoding_prefix = \"u8\" / [uUL]\n\nstring_char = [^\"\\\\\\n] / escape_sequence\n\n////\n// 6.5.1 Primary expression\n////\n\nprimary_expression -> Box> = box>\n\nprimary_expression0 -> Expression =\n a:string_literal { Expression::StringLiteral(Box::new(a)) } /\n a:node { Expression::Constant(Box::new(a)) } /\n a:identifier { Expression::Identifier(Box::new(a)) } /\n \"(\" _ a:expression0 _ \")\" { a } /\n a:node { Expression::GenericSelection(Box::new(a)) } /\n gnu\n\ngeneric_selection -> GenericSelection =\n K<\"_Generic\"> _ \"(\" _ e:assignment_expression _ \",\" _ a:cs1> _ \")\" {\n GenericSelection {\n expression: e,\n associations: a,\n }\n }\n\ngeneric_association -> GenericAssociation =\n t:type_name _ \":\" _ e:assignment_expression {\n let span = Span::span(t.span.start, e.span.end);\n GenericAssociation::Type(Node::new(GenericAssociationType {\n type_name: t,\n expression: e,\n }, span))\n } /\n K<\"default\"> _ \":\" _ e:assignment_expression {\n GenericAssociation::Default(e)\n }\n\n//// 6.5.2 Postfix operators\n\npostfix_expression -> Box> = box>\n\n#[cache]\npostfix_expression0 -> Expression =\n e:node _ t:list0> { apply_ops(t, e).node }\n\npostfix_expression1 -> Expression =\n compound_literal /\n primary_expression0\n\npostfix_expressionT -> Operation =\n index_operator /\n \"(\" _ e:cs0> _ \")\" { Operation::Call(e) } /\n o:node _ i:identifier { Operation::Member(o, i) } /\n o:node { Operation::Unary(o) }\n\nindex_operator -> Operation =\n i:node { Operation::Binary(Node::new(BinaryOperator::Index, i.span), i.node) }\n\nindex_operator0 -> Node =\n \"[\" _ e:node _ \"]\" { e }\n\nmember_operator -> MemberOperator =\n \".\" { MemberOperator::Direct } /\n \"->\" { MemberOperator::Indirect }\n\npostfix_operator -> UnaryOperator =\n \"++\" { UnaryOperator::PostIncrement } /\n \"--\" { UnaryOperator::PostDecrement }\n\ncompound_literal -> Expression =\n n:node { Expression::CompoundLiteral(Box::new(n)) }\n\ncompound_literal_inner -> CompoundLiteral =\n \"(\" _ t:type_name _ \")\" _ \"{\" _ i:cs1> _ \",\"? _ \"}\" {\n CompoundLiteral {\n type_name: t,\n initializer_list: i,\n }\n }\n\n////\n// 6.5.3 Unary operators\n////\n\nunary_expression -> Box> = box>\n\nunary_expression0 -> Expression =\n postfix_expression0 /\n unary_prefix /\n unary_cast /\n sizeof_expression /\n alignof_expression /\n gnu> _ e:unary_expression0 { e }\n\nunary_prefix -> Expression =\n n:node { Expression::UnaryOperator(Box::new(n)) }\n\nunary_prefix_inner -> UnaryOperatorExpression =\n op:node _ e:unary_expression {\n UnaryOperatorExpression {\n operator: op,\n operand: e,\n }\n }\n\nprefix_operator -> UnaryOperator =\n \"++\" { UnaryOperator::PreIncrement } /\n \"--\" { UnaryOperator::PreDecrement }\n\nunary_cast -> Expression =\n n:node { Expression::UnaryOperator(Box::new(n)) }\n\nunary_cast_inner -> UnaryOperatorExpression =\n op:node _ e:cast_expression {\n UnaryOperatorExpression {\n operator: op,\n operand: e,\n }\n }\n\nunary_operator -> UnaryOperator =\n \"&\"!\"&\" { UnaryOperator::Address } /\n \"*\" { UnaryOperator::Indirection } /\n \"+\" { UnaryOperator::Plus } /\n \"-\" { UnaryOperator::Minus } /\n \"~\" { UnaryOperator::Complement } /\n \"!\" { UnaryOperator::Negate }\n\nsizeof_expression -> Expression =\n n:sizeof_ty_expression { Expression::SizeOfTy(n) } /\n n:sizeof_val_expression { Expression::SizeOfVal(n) }\n\nsizeof_ty_expression -> Box> = box>\n\nsizeof_ty_expression0 -> SizeOfTy =\n K<\"sizeof\"> _ \"(\" _ t:type_name _ \")\" {\n SizeOfTy(t)\n }\n\nsizeof_val_expression -> Box> = box>\n\nsizeof_val_expression0 -> SizeOfVal =\n K<\"sizeof\"> _ e:unary_expression {\n SizeOfVal(e)\n }\n\nalignof_expression -> Expression =\n e:alignof { Expression::AlignOf(e) }\n\nalignof -> Box> = box>\n\nalignof0 -> AlignOf =\n K<\"_Alignof\" / gnu<\"__alignof\" \"__\"?>> _ \"(\" _ t:type_name _ \")\" {\n AlignOf(Box::new(t))\n }\n\n////\n// 6.5.4 Cast expressions\n////\n\ncast_expression -> Box> = box>\n\ncast_expression0 -> Expression =\n c:node { Expression::Cast(Box::new(c)) } /\n unary_expression0\n\ncast_expression_inner -> CastExpression =\n \"(\" _ t:type_name _ \")\" _ e:cast_expression {\n CastExpression {\n type_name: t,\n expression: e,\n }\n }\n\n////\n// 6.5.5 -- 6.5.14 Binary operators\n////\n\nbinary_expression -> Box> = box\n\nbinary_expression0 -> Node = #infix {\n#L x o:infix<\"||\"> y { infix(o, BinaryOperator::LogicalOr, x, y) }\n#L x o:infix<\"&&\"> y { infix(o, BinaryOperator::LogicalAnd, x, y) }\n#L x o:infix<\"|\"> y { infix(o, BinaryOperator::BitwiseOr, x, y) }\n#L x o:infix<\"^\"> y { infix(o, BinaryOperator::BitwiseXor, x, y) }\n#L x o:infix<\"&\"!\"&\"> y { infix(o, BinaryOperator::BitwiseAnd, x, y) }\n#L x o:infix<\"==\"> y { infix(o, BinaryOperator::Equals, x, y) }\n x o:infix<\"!=\"> y { infix(o, BinaryOperator::NotEquals, x, y) }\n#L x o:infix<\"<\"> y { infix(o, BinaryOperator::Less, x, y) }\n x o:infix<\">\"> y { infix(o, BinaryOperator::Greater, x, y) }\n x o:infix<\"<=\"> y { infix(o, BinaryOperator::LessOrEqual, x, y) }\n x o:infix<\">=\"> y { infix(o, BinaryOperator::GreaterOrEqual, x, y) }\n#L x o:infix<\"<<\"> y { infix(o, BinaryOperator::ShiftLeft, x, y) }\n x o:infix<\">>\"> y { infix(o, BinaryOperator::ShiftRight, x, y) }\n#L x o:infix<\"+\"> y { infix(o, BinaryOperator::Plus, x, y) }\n x o:infix<\"-\"> y { infix(o, BinaryOperator::Minus, x, y) }\n#L x o:infix<\"*\"> y { infix(o, BinaryOperator::Multiply, x, y) }\n x o:infix<\"/\"> y { infix(o, BinaryOperator::Divide, x, y) }\n x o:infix<\"%\"> y { infix(o, BinaryOperator::Modulo, x, y) }\n}\n\ninfix = _ n:node _ { n }\n\nbinary_operand -> Node = node\n\n////\n// 6.5.15 Conditional operator\n////\n\nconditional_expression -> Box> = box>\n\nconditional_expression0 -> Expression =\n a:binary_expression0 _ t:conditional_expressionT? {\n if let Some((b, c)) = t {\n let span = Span::span(a.span.start, c.span.end);\n Expression::Conditional(Box::new(Node::new(ConditionalExpression {\n condition: Box::new(a),\n then_expression: b,\n else_expression: c,\n }, span)))\n } else {\n a.node\n }\n }\n\nconditional_expressionT -> (Box>, Box>) =\n \"?\" _ a:node _ \":\" _ b:node { (Box::new(a), Box::new(b)) }\n\n////\n// 6.5.16 Assignment operators\n////\n\nassignment_expression -> Box> = box>\n\nassignment_expression0 -> Expression =\n n:node { Expression::BinaryOperator(Box::new(n)) } /\n conditional_expression0\n\nassignment_expression_inner -> BinaryOperatorExpression =\n a:unary_expression _ op:node _ b:assignment_expression {\n BinaryOperatorExpression {\n operator: op,\n lhs: a,\n rhs: b,\n }\n }\n\nassignment_operator -> BinaryOperator =\n \"=\" { BinaryOperator::Assign } /\n \"*=\" { BinaryOperator::AssignMultiply } /\n \"/=\" { BinaryOperator::AssignDivide } /\n \"%=\" { BinaryOperator::AssignModulo } /\n \"+=\" { BinaryOperator::AssignPlus } /\n \"-=\" { BinaryOperator::AssignMinus } /\n \"<<=\" { BinaryOperator::AssignShiftLeft } /\n \">>=\" { BinaryOperator::AssignShiftRight } /\n \"&=\" { BinaryOperator::AssignBitwiseAnd } /\n \"^=\" { BinaryOperator::AssignBitwiseXor } /\n \"|=\" { BinaryOperator::AssignBitwiseOr }\n\n////\n// 6.5.17 Comma operator\n////\n\npub expression -> Box> = box>\n\nexpression0 -> Expression =\n e:node _ t:list0 {\n if t.len() > 0 {\n let mut t = t;\n t.insert(0, e);\n Expression::Comma(Box::new(t))\n } else {\n e.node\n }\n }\n\nexpressionT -> Node =\n \",\" _ e:node { e }\n\n////\n// 6.6 Constant expressions\n////\n\nconstant_expression -> Box> = conditional_expression\nconstant_expression0 -> Expression = conditional_expression0\n\n////\n// 6.7 Declarations\n////\n\npub declaration -> Node = node\n\ndeclaration0 -> Declaration =\n gnu>? _ d:declaration1 _ \";\" {\n Declaration {\n specifiers: d.0,\n declarators: d.1,\n }\n }\n\ndeclaration_seq = h:h _ t:t { (concat(h, t.0), t.1) }\n\ndeclaration1 -> (Vec>, Vec>) =\n declaration_seq\n\ndeclaration2 -> (Vec>, Vec>) =\n declaration_seq /\n declaration_seq> /\n declaration_seq>\n\n// What can follow a type specifier keyword or typename in a declaration\ndeclaration_tail = declaration_seq>\ndeclaration_tail1 =\n declaration_seq> /\n d:declaration_init_declarators { (Vec::new(), d) }\n\n// What can follow a typedef keyword\ndeclaration_typedef_tail -> (Vec>, Vec>) =\n declaration_seq\n\ndeclaration_typedef_tail0 -> (Vec>, Vec>) =\n declaration_seq> /\n declaration_seq>\n\n// What can follow after typedef + type name\ndeclaration_typedef_tail1 = s:s _ d:declaration_type_declarators { (s, d) }\n\ndeclaration_unique_type -> Vec> =\n n:node { vec![ n ] }\n\ndeclaration_nonunique_type -> Vec> =\n n:node { vec![ n ] }\n\ndeclaration_specifiers -> Vec> =\n s:declaration_specifiers_unique _ t:declaration_specifiers_tail { concat(s, t) }\n\ndeclaration_specifiers_tail -> Vec> =\n t:declaration_unique_type _ s:declaration_specifiers_unique { concat(t, s) } /\n t:declaration_nonunique_type _ s:declaration_specifiers_nonunique { concat(t, s) }\n\ndeclaration_specifiers_unique -> Vec> =\n list0>\n\ndeclaration_specifiers_nonunique -> Vec> =\n list0>\n\ndeclaration_specifier_nontype -> DeclarationSpecifier =\n s:storage_class_specifier { DeclarationSpecifier::StorageClass(s) } /\n s:type_qualifier { DeclarationSpecifier::TypeQualifier(s) } /\n s:function_specifier { DeclarationSpecifier::Function(s) } /\n s:alignment_specifier { DeclarationSpecifier::Alignment(s) } /\n s:gnu { DeclarationSpecifier::Extension(s) }\n\ndeclaration_typedef -> Vec> =\n s:node { vec![ s ] }\n\ndeclaration_typedef0 -> DeclarationSpecifier =\n s:storage_class_typedef { DeclarationSpecifier::StorageClass(s) }\n\ndeclaration_specifier_unique_type0 -> DeclarationSpecifier =\n s:node { DeclarationSpecifier::TypeSpecifier(s) }\n\ndeclaration_specifier_nonunique_type0 -> DeclarationSpecifier =\n s:node { DeclarationSpecifier::TypeSpecifier(s) }\n\ndeclaration_init_declarators -> Vec> = cs0>\n\ndeclaration_type_declarators -> Vec> = cs0>\n\ninit_declarator -> InitDeclarator =\n d:init_declarator_declarator _ e:gnu? _ i:node?\n {\n InitDeclarator {\n declarator: with_ext(d, e),\n initializer: i,\n }\n }\n\ninit_declarator_declarator -> Node =\n d:declarator {\n env.handle_declarator(&d, Symbol::Identifier);\n d\n }\n\ninit_declarator_init -> Initializer =\n \"=\" _ i:initializer { i }\n\ninit_declarator_gnu -> Vec> =\n l:asm_label? _ a:attribute_specifier_list { l.into_iter().chain(a).collect() }\n\ntype_declarator -> InitDeclarator =\n d:declarator _ e:gnu?\n {\n env.handle_declarator(&d, Symbol::Typename);\n InitDeclarator {\n declarator: with_ext(d, e),\n initializer: None,\n }\n }\n\n////\n// 6.7.1 Storage-class specifiers\n////\n\nstorage_class_specifier -> Node = node\n\nstorage_class_specifier0 -> StorageClassSpecifier =\n K<\"extern\"> { StorageClassSpecifier::Extern } /\n K<\"static\"> { StorageClassSpecifier::Static } /\n K<\"_Thread_local\"> { StorageClassSpecifier::ThreadLocal } /\n K<\"auto\"> { StorageClassSpecifier::Auto } /\n K<\"register\"> { StorageClassSpecifier::Register }\n\nstorage_class_typedef -> Node = node\n\nstorage_class_typedef0 -> StorageClassSpecifier =\n K<\"typedef\"> { StorageClassSpecifier::Typedef }\n\n////\n// 6.7.2 Type specifiers\n////\n\n// ISO 2011, 6.7.2, ยง2. Void, _Bool, _Atomic, typedef names, struct/unions, and enum\n// specifiers can only appear once in declaration specifiers or specifier-qualifiers.\n// This resolves the ambiguity with typedef names.\ntype_specifier_unique -> TypeSpecifier =\n K<\"void\"> { TypeSpecifier::Void } /\n K<\"_Bool\"> { TypeSpecifier::Bool } /\n K<\"_Atomic\"> _ \"(\" _ t:type_name _ \")\" { TypeSpecifier::Atomic(t) } /\n s:node { TypeSpecifier::Struct(s) } /\n e:node { TypeSpecifier::Enum(e) } /\n t:typedef_name { TypeSpecifier::TypedefName(t) }\n\ntype_specifier_nonunique -> TypeSpecifier =\n K<\"char\"> { TypeSpecifier::Char } /\n K<\"short\"> { TypeSpecifier::Short } /\n K<\"int\"> { TypeSpecifier::Int } /\n K<\"long\"> { TypeSpecifier::Long } /\n K<\"float\"> { TypeSpecifier::Float } /\n K<\"double\"> { TypeSpecifier::Double } /\n K<\"signed\" / gnu<\"__signed\" \"__\"?>> { TypeSpecifier::Signed } /\n K<\"unsigned\"> { TypeSpecifier::Unsigned } /\n K<\"_Complex\" / gnu<\"__complex\" \"__\"?>> { TypeSpecifier::Complex } /\n t:K { TypeSpecifier::TS18661Float(t) } /\n gnu\n\nstruct_or_union_specifier -> StructType =\n t:node _ i:identifier? _ d:struct_or_union_body {\n StructType {\n kind: t,\n identifier: i,\n declarations: d,\n }\n } /\n t:node _ i:identifier {\n StructType {\n kind: t,\n identifier: Some(i),\n declarations: None,\n }\n }\n\nstruct_or_union_body -> Option>> =\n \"{\" _ d:list1> _ \"}\" { Some(d) } /\n gnu<\"{\" _ \"}\"> { Some(Vec::new()) } /\n { None }\n\nstruct_or_union -> StructKind =\n K<\"struct\"> { StructKind::Struct } /\n K<\"union\"> { StructKind::Union }\n\nstruct_declaration -> StructDeclaration =\n f:node { StructDeclaration::Field(f) } /\n s:static_assert { StructDeclaration::StaticAssert(s) } /\n gnu> _ d:struct_declaration { d }\n\nstruct_field -> StructField =\n s:specifier_qualifiers _ d:cs0> _ \";\" gnu<(_ \";\")*>? {\n StructField {\n specifiers: s,\n declarators: d,\n }\n }\n\nspecifier_qualifiers -> Vec> =\n list_eq1_n, node> /\n list_ge1_n, node>\n\nspecifier_qualifier_unique_type0 -> SpecifierQualifier =\n s:node { SpecifierQualifier::TypeSpecifier(s) }\n\nspecifier_qualifier_nonunique_type0 -> SpecifierQualifier =\n s:node { SpecifierQualifier::TypeSpecifier(s) }\n\nspecifier_qualifier_qualifier0 -> SpecifierQualifier =\n q:type_qualifier { SpecifierQualifier::TypeQualifier(q) } /\n e:gnu { SpecifierQualifier::Extension(e) }\n\nstruct_declarator -> StructDeclarator =\n d:declarator? _ \":\" _ e:constant_expression a:gnu? {\n StructDeclarator {\n declarator: d.map(|d| with_ext(d, a)),\n bit_width: Some(e),\n }\n } /\n d:declarator _ a:gnu? {\n StructDeclarator {\n declarator: Some(with_ext(d, a)),\n bit_width: None,\n }\n }\n\nenum_specifier -> EnumType =\n K<\"enum\"> _ i:identifier? _ \"{\" _ e:cs1> _ \",\"? _ \"}\" {\n EnumType {\n identifier: i,\n enumerators: e,\n }\n } /\n K<\"enum\"> _ i:identifier {\n EnumType {\n identifier: Some(i),\n enumerators: Vec::new(),\n }\n }\n\nenumerator -> Enumerator =\n i:identifier _ a:gnu? _ e:enumerator_constant? {\n env.add_symbol(&i.node.name, Symbol::Identifier);\n Enumerator {\n identifier: i,\n expression: e,\n extensions: a.unwrap_or_default(),\n }\n }\n\nenumerator_constant -> Box> =\n \"=\" _ e:constant_expression { e }\n\n////\n// 6.7.3 Type qualifiers\n////\n\ntype_qualifier -> Node = node\n\ntype_qualifier0 -> TypeQualifier =\n K<\"const\" / gnu<\"__const\">> { TypeQualifier::Const } /\n K<\"restrict\" / gnu<\"__restrict\" \"__\"?>> { TypeQualifier::Restrict } /\n K<\"volatile\" / gnu<\"__volatile\" \"__\"?>> { TypeQualifier::Volatile } /\n clang> { TypeQualifier::Nonnull } /\n clang> { TypeQualifier::NullUnspecified } /\n clang> { TypeQualifier::Nullable } /\n // 6.7.2.4: _Atomics followed by a \"(\" are interpreted as type specifiers.\n K<\"_Atomic\"> _ !\"(\" { TypeQualifier::Atomic }\n\n////\n// 6.7.4 Function specifiers\n////\n\nfunction_specifier -> Node = node\n\nfunction_specifier0 -> FunctionSpecifier =\n K<\"inline\" / gnu<\"__inline\" \"__\"?>> { FunctionSpecifier::Inline } /\n K<\"_Noreturn\"> { FunctionSpecifier::Noreturn }\n\n////\n// 6.7.5 Alignment specifiers\n////\n\nalignment_specifier -> Node = node\n\nalignment_specifier0 -> AlignmentSpecifier =\n K<\"_Alignas\"> _ \"(\" _ t:type_name _ \")\" { AlignmentSpecifier::Type(t) } /\n K<\"_Alignas\"> _ \"(\" _ e:constant_expression _ \")\" { AlignmentSpecifier::Constant(e) }\n\n////\n// 6.7.6 Declarators\n////\n\ndeclarator -> Node = node\n\ndeclarator0 -> Declarator =\n attr:gnu? _\n pointer:list0 _\n kind:node _\n derived:list0>\n {\n Declarator {\n kind: kind,\n derived: concat(pointer, derived),\n extensions: attr.unwrap_or_default(),\n }\n }\n\ndirect_declarator -> DeclaratorKind =\n i:identifier { DeclaratorKind::Identifier(i) } /\n \"(\" _ d:declarator _ \")\" { DeclaratorKind::Declarator(Box::new(d)) }\n\nderived_declarator -> DerivedDeclarator =\n \"[\" _ a:node { DerivedDeclarator::Array(a) } /\n \"(\" _ f:scoped> _ \")\" { DerivedDeclarator::Function(f) } /\n \"(\" _ p:cs0 _ \")\" { DerivedDeclarator::KRFunction(p) }\n\narray_declarator -> ArrayDeclarator =\n q:list0 _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::Unknown,\n }\n } /\n q:list0 _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::VariableExpression(e),\n }\n } /\n K<\"static\"> _ q:list0 _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::StaticExpression(e),\n }\n } /\n q:list1 _ K<\"static\"> _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::StaticExpression(e),\n }\n } /\n q:list0 _ \"*\" _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::VariableUnknown,\n }\n }\n\nfunction_declarator -> FunctionDeclarator =\n p:cs1 _ e:ellipsis {\n FunctionDeclarator {\n parameters: p,\n ellipsis: e,\n }\n }\n\npointer -> Node = node\n\npointer0 -> DerivedDeclarator =\n t:$(\"*\" / clang<\"^\">) _ q:list0> {\n if t == \"^\" {\n DerivedDeclarator::Block(q)\n } else {\n DerivedDeclarator::Pointer(q)\n }\n }\n\npointer_qualifier -> PointerQualifier =\n q:type_qualifier { PointerQualifier::TypeQualifier(q) } /\n e:gnu { PointerQualifier::Extension(e) }\n\nellipsis -> Ellipsis =\n \",\" _ \"...\" { Ellipsis::Some } / { Ellipsis::None }\n\nparameter_declaration -> Node = node\n\nparameter_declaration0 -> ParameterDeclaration =\n s:declaration_specifiers _ d:parameter_declarator _ a:gnu? {\n ParameterDeclaration {\n specifiers: s,\n declarator: d,\n extensions: a.unwrap_or_default()\n }\n }\n\nparameter_declarator -> Option> =\n d:declarator {\n env.handle_declarator(&d, Symbol::Identifier);\n Some(d)\n } /\n d:abstract_declarator { Some(d) } /\n { None }\n\n////\n// 6.7.7 Type names\n////\n\ntype_name -> Node = node\n\ntype_name0 -> TypeName =\n s:specifier_qualifiers _ d:abstract_declarator? {\n TypeName {\n specifiers: s,\n declarator: d,\n }\n }\n\nabstract_declarator -> Node = node\n\nabstract_declarator0 -> Declarator =\n p:list0 _ k:node _ d:list0 {\n Declarator {\n kind: k,\n derived: concat(p, d),\n extensions: Vec::new(),\n }\n } /\n p:list0 k:#position _ d:list1 {\n Declarator {\n kind: Node::new(DeclaratorKind::Abstract, Span::span(k, k)),\n derived: concat(p, d),\n extensions: Vec::new(),\n }\n } /\n p:list1 k:#position {\n Declarator {\n kind: Node::new(DeclaratorKind::Abstract, Span::span(k, k)),\n derived: p,\n extensions: Vec::new(),\n }\n }\n\ndirect_abstract_declarator -> DeclaratorKind =\n \"(\" _ d:abstract_declarator _ \")\" { DeclaratorKind::Declarator(Box::new(d)) }\n\nderived_abstract_declarator -> Node = node\n\nderived_abstract_declarator0 -> DerivedDeclarator =\n \"[\" _ a:node { DerivedDeclarator::Array(a) } /\n \"(\" _ d:node _ \")\" { DerivedDeclarator::Function(d) }\n\nabstract_array_declarator -> ArrayDeclarator =\n q:list0 _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::Unknown,\n }\n } /\n q:list0 _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::VariableExpression(e),\n }\n } /\n K<\"static\"> _ q:list0 _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::StaticExpression(e),\n }\n } /\n q:list1 _ K<\"static\"> _ e:assignment_expression _ \"]\" {\n ArrayDeclarator {\n qualifiers: q,\n size: ArraySize::StaticExpression(e),\n }\n } /\n \"*\" _ \"]\" {\n ArrayDeclarator {\n qualifiers: Vec::new(),\n size: ArraySize::VariableUnknown,\n }\n }\n\nabstract_function_declarator -> FunctionDeclarator =\n p:cs1 _ e:ellipsis {\n FunctionDeclarator {\n parameters: p,\n ellipsis: e,\n }\n } /\n {\n FunctionDeclarator {\n parameters: Vec::new(),\n ellipsis: Ellipsis::None,\n }\n }\n\n\n////\n// 6.7.8 Type definitions\n////\n\ntypedef_name -> Node = #quiet / #expected(\"\")\n\ntypedef_name0 -> Node = i:identifier {?\n if env.is_typename(&i.node.name) {\n Ok(i)\n } else {\n Err(\"\")\n }\n}\n\n////\n// 6.7.9 Initialization\n////\n\ninitializer -> Initializer =\n e:assignment_expression { Initializer::Expression(e) } /\n \"{\" _ i:cs1> _ \",\"? _ \"}\" { Initializer::List(i) } /\n gnu<\"{\" _ \"}\"> { Initializer::List(Vec::new()) }\n\ninitializer_list_item -> InitializerListItem =\n d:designation? _ i:node {\n InitializerListItem {\n designation: d.unwrap_or_default(),\n initializer: Box::new(i),\n }\n }\n\ndesignation -> Vec> =\n d:list1> _ \"=\" { d } /\n d:gnu> { vec! [ d ] } /\n d:gnu> { vec![ d ] }\n\ncolon_designation -> Designator =\n i:identifier _ \":\" { Designator::Member(i) }\n\ndesignator -> Designator =\n d:array_designator { d } /\n \".\" _ i:identifier { Designator::Member(i) }\n\narray_designator -> Designator =\n \"[\" _ a:node _ b:gnu? \"]\" {\n match b {\n Some(b) => {\n let span = Span::span(a.span.start, b.span.end);\n Designator::Range(Node::new(RangeDesignator { from: a, to: b }, span))\n }\n None => Designator::Index(a),\n }\n }\n\nrange_suffix -> Node = // shared with label\n \"...\" _ e:node { e }\n\n////\n// 6.7.10 Static assertions\n////\n\nstatic_assert -> Node = node\n\nstatic_assert0 -> StaticAssert =\n gnu>?\n _ K<\"_Static_assert\"> _ \"(\" _ e:constant_expression _ \",\" _ s:string_literal _ \")\" _ \";\" {\n StaticAssert {\n expression: e,\n message: s,\n }\n }\n\n////\n// 6.8 Statements and blocks\n////\n\npub statement -> Box> = box>\n\nstatement0 -> Statement =\n s:node { Statement::Labeled(s) } /\n scoped /\n expression_statement /\n scoped /\n scoped /\n jump_statement /\n gnu\n\n////\n// 6.8.1 Labeled statements\n////\n\nlabeled_statement -> LabeledStatement =\n l:node