• Title/Summary/Keyword: Parse

Search Result 132, Processing Time 0.021 seconds

Delayed Reduction Algorithms of DJ Graph using Path Compression (경로 압축을 이용한 DJ 그래프의 지연 감축 알고리즘)

  • Sim, Son-Kwon;Ahn, Heui-Hak
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.171-180
    • /
    • 2002
  • The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian's path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.

Automatic Compiler Generator for Visual Languages using Semantic Actions based on Classes (클래스 기반의 의미수행코드 명세를 이용한 시각언어 컴파일러 자동 생성)

  • 김경아
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.1088-1099
    • /
    • 2003
  • The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.

  • PDF

Implementation of C++ ID Compiler (C++ IDL 컴파일러 구현)

  • Park, Chan-Mo;Lee, Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.970-976
    • /
    • 2001
  • In this paper, OUIG IDL CFE, provided by Sunsoft, is used to take a IDL definitions as inputs and parse those. OmniORB3 is introduced to support functionality of the ORB. Suns CFE produce AST after parsing inputs. Actually, the node of AST Is instances of classes which are derived from CFE classes. As the compiler back end visit the node of the AST using iterator class, UTL_ScopeActiveIterator, it dumps codes of output. During processing, two files are generated. Routines of generating code are invoked by BE_produce.cc and codes are produced while visiting root of AST, idl_global->root(). The dump* functions which dump codes is called according to the type of node. In this paper, Mapping C++ of IDL definition is experimented and results In the same as that of omniidl which is provided by omniORB3. The code of results behavior correctly on omniORB3. In the future, we are interested in optimizing the performance of marshalling code via IDL compiler.

  • PDF

Generalized LR Parser with Conditional Action Model(CAM) using Surface Phrasal Types (표층 구문 타입을 사용한 조건부 연산 모델의 일반화 LR 파서)

  • 곽용재;박소영;황영숙;정후중;이상주;임해창
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.81-92
    • /
    • 2003
  • Generalized LR parsing is one of the enhanced LR parsing methods so that it overcome the limit of one-way linear stack of the traditional LR parser using graph-structured stack, and it has been playing an important role of a firm starting point to generate other variations for NL parsing equipped with various mechanisms. In this paper, we propose a conditional Action Model that can solve the problems of conventional probabilistic GLR methods. Previous probabilistic GLR parsers have used relatively limited contextual information for disambiguation due to the high complexity of internal GLR stack. Our proposed model uses Surface Phrasal Types representing the structural characteristics of the parse for its additional contextual information, so that more specified structural preferences can be reflected into the parser. Experimental results show that our GLR parser with the proposed Conditional Action Model outperforms the previous methods by about 6-7% without any lexical information, and our model can utilize the rich stack information for syntactic disambiguation of probabilistic LR parser.

Two-Level Machine Learning Approach to Identify Maximal Noun Phrase in Chinese (두 단계 학습을 통한 중국어 최장명사구 자동식별)

  • Yin, Chang-Hao;Lee, Yong-Hun;Jin, Mei-Xun;Kim, Dong-Il;Lee, Jong-Hyeok
    • Annual Conference on Human and Language Technology
    • /
    • 2004.10d
    • /
    • pp.53-61
    • /
    • 2004
  • 일반적으로 중국어의 명사구는 기본명사구(base noun phrase), 최장명사구(maximal noun phrase) 등으로 분류된다. 최장명사구에 대한 정확한 식별은 문장의 전체적인 구조를 파악하고 정확한 구문 트리(parse tree)를 찾아내는데 중요한 역할을 한다. 본 논문은 두 단계 학습모델을 이용하여 최장명사구 자동식별을 진행한다. 먼저 기본명사구, 기본동사구, 기본형용사구, 기본부사구, 기본수량사구, 기본단문구, 기본전치사구, 기본방향사구 등 8가지 기본구를 식별한다. 다음 기본구의 중심어(head)를 추출해 내고 이 정보를 이용하여 최장명사구의 식별을 진행한다. 본 논문에서 제안하는 방법은 기존의 단어레벨의 접근방법과는 달리구레벨에서 학습을 진행하기 때문에 주변문맥의 정보를 많이 고려해야 하는 최장명사구 식별에 있어서 아주 효과적인 접근방법이다. 후처리 작업을 하지 않고 기본구의 식별에서 25개 기본구 태그의 평균 F-measure가 96%, 평균길이가 7인 최장명사구의 식별에서 4개 태그의 평균 F-measure가 92.5%로 좋은 성능을 보여주었다.

  • PDF

The Parallel Corpus Approach to Building the Syntactic Tree Transfer Set in the English-to- Vietnamese Machine Translation

  • Dien Dinh;Ngan Thuy;Quang Xuan;Nam Chi
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.382-386
    • /
    • 2004
  • Recently, with the machine learning trend, most of the machine translation systems on over the world use two syntax tree sets of two relevant languages to learn syntactic tree transfer rules. However, for the English-Vietnamese language pair, this approach is impossible because until now we have not had a Vietnamese syntactic tree set which is correspondent to English one. Building of a very large correspondent Vietnamese syntactic tree set (thousands of trees) requires so much work and take the investment of specialists in linguistics. To take advantage from our available English-Vietnamese Corpus (EVC) which was tagged in word alignment, we choose the SITG (Stochastic Inversion Transduction Grammar) model to construct English- Vietnamese syntactic tree sets automatically. This model is used to parse two languages at the same time and then carry out the syntactic tree transfer. This English-Vietnamese bilingual syntactic tree set is the basic training data to carry out transferring automatically from English syntactic trees to Vietnamese ones by machine learning models. We tested the syntax analysis by comparing over 10,000 sentences in the amount of 500,000 sentences of our English-Vietnamese bilingual corpus and first stage got encouraging result $(analyzed\;about\;80\%)[5].$ We have made use the TBL algorithm (Transformation Based Learning) to carry out automatic transformations from English syntactic trees to Vietnamese ones based on that parallel syntactic tree transfer set[6].

  • PDF

Design of Web Retrieval Component for Marine Leisure Information Database (해양레저정보 데이터베이스 구축을 위한 웹 탐색 컴포넌트 설계)

  • Choi, Hong-Seok;Jung, Sung-Hun;Ahn, Seong-Hwan;Yim, Jae-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.142-145
    • /
    • 2005
  • According as marine leisure industry has developed and the demand of leisure culture has increased rapidly, a desire about service which supply marine safety and connect marine information is enlarging. We wish to develop contents of download form that supply geographic information of Electronic Navigational Chart(ENC) in the marine that is digitalized to carrying along terminal of WIPI base and various informations for marine leisure. For this, DB that offer ENC and additional information should be constructed. Also, we need server(CPS; Contents provider Server) that offer required contents. In this paper, we design web retrieval component which store request information to database. When consumer required necessary information through personal mobile device, CPS can inform that. So, we wish to develop web retrieval agent component that parse informations in various World Wide Webs, and store to database.

  • PDF

Metadata production system based on MPEG-21 IPMP for protection of broadcasting contents (방송 콘텐츠 보호를 위한 MPEG-21 IPMP 기반의 메타데이터 저작 시스템)

  • Ryu, Kwang-Hee;Kim, Kwang-Yong;Kim, Jae-Gon;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.619-622
    • /
    • 2005
  • When Digital Contents goes through production${\cdot}$delivery${\cdot}$consumption, MPEG(Moving Picture Expers Group)-21 IPMP(Intellectual Property Management and Protection) defines standard which have defined by FCD(Final Committee Draft) level to keep the Digital Contents in safety. And development of system which applied to latest standard to protect and manage the broadcasting contents is required. Currently, the system to protect and manage the broadcast contents consists of fourth organizations which means production server, tool server, license server, consumption server. In this paper, we made production server to parse REL(Right Expression Language) document that has right information for content from license server, and create metadata based on MPEG-21 IPMP about the content that applied to watermark. then, after it do remuxing, transmit the protected data to consumption server.

  • PDF

Component Design of Marine Leisure Information Retrieval Agent (해양레저정보 탐색 에이전트의 컴포넌트 설계)

  • Choi Hong-Seok;Jung Sung-Hun;Yim Jae-Hong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2005.10a
    • /
    • pp.221-224
    • /
    • 2005
  • According as marine leisure industry has developed and the demand of leisure culture has increased rapidly, a desire about service which supply marine safety and connect marine information is enlarging. We wish tc develop contents of download form that supply geographic information of Electronic Navigational Chart(ENC) in the marine that is digitalized to carrying along terminal of WIPI base and various informations for marine leisure. For this, DB that offer ENC and additional information should be constructed. Also, we need server (CPS; Contents provider Server) that offer required contents. In this paper, we design web retrieval component which store request information to database. When consumer required necessary information through personal mobile device, CPS can inform that. So, we wish to develop web retrieval agent component that parse informations in various World Wide Webs, and store to database.

  • PDF

Design of Smart AP for DASH Service in Non-DASH Client (Non-DASH 클라이언트상에서 DASH 서비스 제공 가능한 Smart AP 설계)

  • Jeon, Seong Hee;Cho, Min Ju;Lee, Wong Jae;Hwang, Jun;Paik, Jong Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.2
    • /
    • pp.47-53
    • /
    • 2012
  • In general, it is essential that contents are to be provided with proper bitrate according to network conditions in order to support higher quality of video streaming services over wired and wireless networks. Recently, DASH is adopted by the MPEG as the standard for HTTP based adaptive streaming technology and consists of the server and clients. The clients should parse XML files from the server and play contents after accessing the finely divided segments into various bitrates. In this paper, we designed a Smart AP(Access Point) which exists between DASH contents server and Non-DASH clients enables provide DASH services to Non-DASH clients. In addition, proposed Smart AP provides DASH service to various types of clients as maintaining the existing environment without additional development costs.