{"id":"https://openalex.org/W2930353364","doi":"https://doi.org/10.7287/peerj.preprints.27465v2","title":"Parsing multi-ordered grammars with the Gray algorithm","display_name":"Parsing multi-ordered grammars with the Gray algorithm","publication_year":2019,"publication_date":"2019-02-18","ids":{"openalex":"https://openalex.org/W2930353364","doi":"https://doi.org/10.7287/peerj.preprints.27465v2","mag":"2930353364"},"language":"en","primary_location":{"id":"doi:10.7287/peerj.preprints.27465v2","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27465v2","pdf_url":"https://peerj.com/preprints/27465.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://peerj.com/preprints/27465.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028331572","display_name":"Nick Papoulias","orcid":"https://orcid.org/0000-0002-3649-1097"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I78744979","display_name":"La Rochelle Universit\u00e9","ror":"https://ror.org/04mv1z119","country_code":"FR","type":"education","lineage":["https://openalex.org/I78744979"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nick Papoulias","raw_affiliation_strings":["UMR 7266 LIENSs, CNRS, University of La Rochelle, La Rochelle, France"],"raw_orcid":"https://orcid.org/0000-0002-3649-1097","affiliations":[{"raw_affiliation_string":"UMR 7266 LIENSs, CNRS, University of La Rochelle, La Rochelle, France","institution_ids":["https://openalex.org/I78744979","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028331572"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I78744979"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02623009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.8312154412269592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7806277275085449},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7637896537780762},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.6740031242370605},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.6193113923072815},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6106123924255371},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5490747094154358},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.46308761835098267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44659820199012756},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.43043771386146545},{"id":"https://openalex.org/keywords/top-down-parsing-language","display_name":"Top-down parsing language","score":0.4268030822277069},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.4155787229537964},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.4111522138118744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3916154205799103},{"id":"https://openalex.org/keywords/bottom-up-parsing","display_name":"Bottom-up parsing","score":0.3259311020374298},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30032438039779663},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.2640606164932251},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.19519424438476562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14341378211975098}],"concepts":[{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.8312154412269592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7806277275085449},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7637896537780762},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.6740031242370605},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.6193113923072815},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6106123924255371},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5490747094154358},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.46308761835098267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44659820199012756},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.43043771386146545},{"id":"https://openalex.org/C166651950","wikidata":"https://www.wikidata.org/wiki/Q7824365","display_name":"Top-down parsing language","level":5,"score":0.4268030822277069},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.4155787229537964},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.4111522138118744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3916154205799103},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.3259311020374298},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30032438039779663},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.2640606164932251},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.19519424438476562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14341378211975098},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7287/peerj.preprints.27465v2","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27465v2","pdf_url":"https://peerj.com/preprints/27465.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.7287/peerj.preprints.27465v2","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27465v2","pdf_url":"https://peerj.com/preprints/27465.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2930353364.pdf","grobid_xml":"https://content.openalex.org/works/W2930353364.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3143982968","https://openalex.org/W4320024782","https://openalex.org/W2164260211","https://openalex.org/W2090257971","https://openalex.org/W2943197582","https://openalex.org/W2105710547","https://openalex.org/W2175212756","https://openalex.org/W2077094028","https://openalex.org/W2154973422","https://openalex.org/W1482538754"],"abstract_inverted_index":{"Background.":[0],"Context-free":[1],"grammars":[2,148],"(CFGs)":[3],"and":[4,17,89,165,184,197,210,215,222,264,278,293,315,332,354,368,386],"Parsing-expression":[5],"Grammars":[6,176],"(PEGs)":[7],"are":[8,50,63,73,112,310],"the":[9,28,31,39,70,96,99,105,109,151,154,182,246,257,299,357],"two":[10,71,106,253,270],"main":[11],"formalisms":[12],"used":[13,74,240],"by":[14,205,229,350,377],"formal":[15,100],"specifications":[16],"parsing":[18,79,91,135,232,238,380],"frameworks":[19,136],"to":[20,127,145,149,181,213,255,262,312,322,365],"describe":[21],"programming":[22],"languages.":[23],"They":[24],"mainly":[25],"differ":[26],"in":[27,65,122,162,167,307,335],"definition":[29],"of":[30,41,78,98,118,153,193,220,259,269,301,372],"choice":[32,43,57],"operator,":[33],"describing":[34],"language":[35,123,200,318],"alternatives.":[36],"CFGs":[37,88,263,367],"support":[38,54],"use":[40],"non-deterministic":[42,211,333],"(i.e.,":[44,58],"unordered":[45],"choice),":[46,60],"where":[47,61],"all":[48],"alternatives":[49,62],"equally":[51],"explored.":[52],"PEGs":[53],"a":[55,115,190,218,230,279,286,336,362],"deterministic":[56,209,331],"ordered":[59],"explored":[64],"strict":[66],"succession.":[67],"In":[68,125],"practice":[69],"formalisms,":[72,107],"through":[75],"concrete":[76],"classes":[77],"algorithms":[80,111],"(such":[81],"as":[82,178],"Left-to-right,":[83],"rightmost":[84],"derivation":[85],"(LR)":[86],"for":[87,92,114,189,241,352,384],"Packrat":[90],"PEGs),":[93],"that":[94,235,306,329],"follow":[95],"semantics":[97],"operators.":[101,249],"Problem":[102],"Statement.":[103],"Neither":[104],"nor":[108],"accompanying":[110],"sufficient":[113],"complete":[116],"description":[117],"common":[119],"cases":[120,164],"arising":[121],"design.":[124,201],"order":[126],"properly":[128],"handle":[129],"ambiguity,":[130,194],"recursion,":[131],"precedence":[132],"or":[133,142],"associativity,":[134],"either":[137],"introduce":[138,174],"implementation":[139,323],"specific":[140,324],"directives":[141],"ask":[143],"users":[144],"refactor":[146],"their":[147],"fit":[150],"needs":[152],"framework/algorithm/formalism":[155],"combo.":[156],"This":[157,202],"introduces":[158],"significant":[159],"complexity":[160,314],"even":[161],"simple":[163,280],"results":[166],"incompatible":[168],"grammar":[169,277,292,338],"specifications.":[170],"Our":[171],"Proposal.":[172],"We":[173,251,304,327],"Multi-Ordered":[175],"(MOGs)":[177],"an":[179],"alternative":[180,364],"CFG":[183],"PEG":[185],"formalisms.":[186],"MOGs":[187,309,373],"aim":[188],"better":[191],"exploration":[192],"ordering,":[195],"recursion":[196],"associativity":[198],"during":[199],"is":[203,227,340],"achieved":[204],"(a)":[206],"allowing":[207],"both":[208,366],"choices":[212,334],"co-exist,":[214],"(b)":[216],"introducing":[217],"form":[219],"recursive":[221,353,385],"scoped":[223,355,387],"ordering.":[224,388],"The":[225,266,283],"formalism":[226,360],"accompanied":[228],"new":[231,295],"algorithm":[233],"(Gray)":[234],"extends":[236],"chart":[237,379],"(normally":[239],"Natural":[242],"Language":[243],"Processing)":[244],"with":[245,381],"proposed":[247],"MOG":[248,382],"Results.":[250],"conduct":[252],"case-studies":[254],"assess":[256],"expressiveness":[258],"MOGs,":[260],"compared":[261],"PEGs.":[265,369],"first":[267],"consists":[268],"idealized":[271],"examples":[272],"from":[273],"literature":[274],"(an":[275],"expression":[276],"procedural":[281],"language).":[282],"second":[284],"examines":[285],"real-world":[287],"case":[288],"(the":[289],"entire":[290],"Smalltalk":[291,296],"eleven":[294],"extensions)":[297],"probing":[298],"complexities":[300],"practical":[302],"needs.":[303],"show":[305],"comparison,":[308],"able":[311],"reduce":[313],"naturally":[316],"express":[317],"constructs,":[319],"without":[320],"resorting":[321],"directives.":[325],"Conclusion.":[326],"conclude":[328],"combining":[330],"single":[337],"specification":[339],"indeed":[341],"not":[342],"only":[343],"possible":[344],"but":[345],"also":[346],"beneficial.":[347],"Moreover,":[348],"augmented":[349],"operators":[351,383],"ordering":[356],"resulting":[358],"multi-ordered":[359],"presents":[361],"viable":[363],"Concrete":[370],"implementations":[371],"can":[374],"be":[375],"constructed":[376],"extending":[378]},"counts_by_year":[],"updated_date":"2025-11-25T14:43:58.451035","created_date":"2025-10-10T00:00:00"}