{"id":"https://openalex.org/W827344981","doi":null,"title":"A Threaded Tree Construction Algorithm not Using Stack","display_name":"A Threaded Tree Construction Algorithm not Using Stack","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W827344981","mag":"827344981"},"language":"en","primary_location":{"id":"mag:1556159714","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/667355","pdf_url":null,"source":{"id":"https://openalex.org/S4306515680","display_name":"Journal of Internet Computing and services","issn_l":"1598-0170","issn":["1598-0170","2287-1136"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Internet Computing and services","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W827344981"],"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/A5041035331","display_name":"Dae-Sik Lee","orcid":"https://orcid.org/0000-0003-1067-292X","observed_orcids":["https://orcid.org/0000-0003-1067-292X"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"\uc774\ub300\uc2dd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5041035331"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"5","first_page":"119","last_page":"127"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.5175999999046326,"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.5175999999046326,"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.32589998841285706,"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/T11269","display_name":"Algorithms and Data Compression","score":0.08449999988079071,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/incremental-parsing","display_name":"incremental parsing","score":0.9660000205039978},{"id":"https://openalex.org/keywords/parsing-speed","display_name":"parsing speed","score":0.4189999997615814},{"id":"https://openalex.org/keywords/memory-reduction","display_name":"memory reduction","score":0.6930000185966492}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7846635580062866},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.7387422919273376},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6956140995025635},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6179553866386414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5586380958557129},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.5221381783485413},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46845269203186035},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.46458345651626587},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.44026151299476624},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.4142528474330902},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.3700301945209503},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3610351085662842},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3350962698459625},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1892096996307373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12075850367546082},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1556159714","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/667355","pdf_url":null,"source":{"id":"https://openalex.org/S4306515680","display_name":"Journal of Internet Computing and services","issn_l":"1598-0170","issn":["1598-0170","2287-1136"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Internet Computing and services","raw_type":null},{"id":"mag:827344981","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=OTJBCD_2004_v5n5_119","pdf_url":null,"source":{"id":"https://openalex.org/S4306515680","display_name":"Journal of Internet Computing and services","issn_l":"1598-0170","issn":["1598-0170","2287-1136"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Internet Computing and services","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W327314173","https://openalex.org/W1994456160","https://openalex.org/W2092877099","https://openalex.org/W2043093716","https://openalex.org/W2083717890","https://openalex.org/W2358855848","https://openalex.org/W2296332834","https://openalex.org/W2020749411"],"abstract_inverted_index":{"As,":[0],"the":[1,25,46,58,63],"development":[2],"of":[3,19],"language-based":[4],"programming":[5],"environment,":[6],"a":[7],"study":[8],"on":[9],"incremental":[10,28,70],"parsing":[11,29,36],"has":[12],"become":[13],"an":[14],"essential":[15],"part.":[16],"The":[17],"purpose":[18],"this":[20],"paper":[21,44],"is":[22],"to":[23,56],"show":[24],"more":[26],"efficient":[27],"algorithm":[30,50,64],"than":[31],"earlier":[32],"one":[33],"that":[34],"demands":[35],"speed":[37],"and":[38,68],"memorizing":[39],"space":[40],"too":[41],"much.":[42],"This":[43],"suggests":[45],"threaded":[47,71],"tree":[48,72],"construction":[49,69],"not":[51,73],"using":[52,74],"stack.":[53,75],"In":[54],"addition,":[55],"remove":[57],"reparsing":[59],"process,":[60],"it":[61],"proposes":[62],"for":[65],"creation":[66],"node":[67]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W827344981","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
