{"id":"https://openalex.org/W7096166609","doi":null,"title":"Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking.\u201d Fundamenta Informaticae","display_name":"Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking.\u201d Fundamenta Informaticae","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096166609"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.491.2601","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.491.2601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.romanredz.se/papers/Parsing.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096166609"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031372269","display_name":"Roman R. Redziejowski","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Roman R. Redziejowski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5031372269"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.8471999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.8471999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.13830000162124634,"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"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.0044999998062849045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parsing-expression-grammars","display_name":"parsing expression grammars","score":0.8640000224113464},{"id":"https://openalex.org/keywords/recursive-descent-parsing","display_name":"recursive descent parsing","score":0.878000020980835},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.9589999914169312},{"id":"https://openalex.org/keywords/language-specification","display_name":"language specification","score":0.6669999957084656},{"id":"https://openalex.org/keywords/formal-language-theory","display_name":"formal language theory","score":0.46299999952316284},{"id":"https://openalex.org/keywords/parser-implementation","display_name":"parser implementation","score":0.5}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.8515999913215637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.703000009059906},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.6690000295639038},{"id":"https://openalex.org/C35164859","wikidata":"https://www.wikidata.org/wiki/Q1756442","display_name":"LR parser","level":4,"score":0.6549000144004822},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5690000057220459},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5230000019073486},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5182999968528748},{"id":"https://openalex.org/C118364021","wikidata":"https://www.wikidata.org/wiki/Q7139956","display_name":"Parser combinator","level":3,"score":0.4636000096797943},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.45840001106262207},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4246000051498413},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.42320001125335693},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.37599998712539673},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.3366999924182892},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.3068999946117401},{"id":"https://openalex.org/C2779525943","wikidata":"https://www.wikidata.org/wiki/Q1187300","display_name":"Grammaticality","level":3,"score":0.3037000000476837},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2840000092983246},{"id":"https://openalex.org/C114408938","wikidata":"https://www.wikidata.org/wiki/Q333373","display_name":"Abstract syntax","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C191563868","wikidata":"https://www.wikidata.org/wiki/Q1427416","display_name":"Generalized phrase structure grammar","level":5,"score":0.2759999930858612},{"id":"https://openalex.org/C11742125","wikidata":"https://www.wikidata.org/wiki/Q1195374","display_name":"Syntax error","level":4,"score":0.26170000433921814},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.491.2601","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.491.2601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.romanredz.se/papers/Parsing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1542200249","https://openalex.org/W2280766147","https://openalex.org/W4381196509","https://openalex.org/W6949223204","https://openalex.org/W1531646285","https://openalex.org/W98833579","https://openalex.org/W7100117443","https://openalex.org/W1861635221","https://openalex.org/W7098705980","https://openalex.org/W7100339186"],"abstract_inverted_index":{"Two":[0],"recent":[1],"developments":[2],"in":[3,27,38,56,83,98],"the":[4,78,89,123],"eld":[5],"of":[6,29,42,76,80],"formal":[7],"languages":[8],"are":[9],"Parsing":[10],"Expression":[11],"Grammar":[12],"(PEG)":[13],"and":[14,86],"packrat":[15,110],"parsing.":[16],"The":[17,100,119],"PEG":[18,84,90,133],"formalism":[19],"is":[20,49,130],"similar":[21],"to":[22,53],"BNF,":[23],"but":[24],"denes":[25],"syntax":[26,79,125],"terms":[28],"recognizing":[30],"strings,":[31],"rather":[32],"than":[33],"constructing":[34],"them.":[35],"It":[36,59],"is,":[37],"fact,":[39],"precise":[40],"specication":[41],"a":[43,50,65,135],"backtracking":[44,55],"recursive-descent":[45,57],"parser.":[46],"Packrat":[47],"parsing":[48,94,111],"general":[51],"method":[52],"handle":[54],"parsers.":[58],"ensures":[60],"linear":[61],"working":[62],"time,":[63],"at":[64],"huge":[66],"memory":[67],"cost.":[68],"This":[69],"paper":[70],"reports":[71],"an":[72,105,114],"experiment":[73],"that":[74,109,127],"consisted":[75],"dening":[77,122],"Java":[81,124],"1.5":[82],"formalism,":[85],"literally":[87],"transcribing":[88],"de":[91],"nitions":[92],"into":[93],"procedures":[95],"(accidentally,":[96],"also":[97],"Java).":[99],"resulting":[101],"primitive":[102],"parser":[103],"shows":[104],"acceptable":[106],"behavior,":[107],"indicating":[108],"might":[112],"be":[113],"overkill":[115],"for":[116],"practical":[117],"languages.":[118],"exercise":[120],"with":[121],"suggests":[126],"more":[128],"work":[129],"needed":[131],"on":[132],"as":[134],"language":[136],"speci":[137],"cation":[138],"tool.":[139],"1":[140]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}