zoukankan      html  css  js  c++  java
  • 用正则表达式输出rdf文档的三元组格式数据

    占个位置

    1、输出所有尖括号里的内容

    package com.jena;
    
    import java.io.BufferedReader;
    import java.io.FileReader;
    import java.util.regex.Matcher;
    import java.util.regex.Pattern;
    
    public class rdfReader3 {
        static String url="";
        
        public static void main(String[] args) {
            FileReader fr=null;
            BufferedReader br=null;
            try{
                fr=new FileReader("C:/Users/Don/workspace/Jena/src/com/jena/bindingsite");
                br=new BufferedReader(fr);
                String s=" ";
                StringBuffer str=new StringBuffer();
                while((s=br.readLine())!=null){
                    Pattern p= Pattern.compile("<([^<>]*)>");
                    Matcher m=p.matcher(s);
                  
                    while(m.find()){
                        System.out.println(m.group(1));
                    }
                }
                
            }catch(Exception e){
                System.out.println(e.getMessage());
            }
            
            
        }
        
        
    
    }

    2、输出rdf.xml文档里某些内容

    package rdf;
    
    import java.io.BufferedReader;
    import java.io.FileReader;
    import java.util.regex.Matcher;
    import java.util.regex.Pattern;
    
    public class rdfReader3 {
        static String url="";
        
        public static void main(String[] args) {
            FileReader fr=null;
            BufferedReader br=null;
            try{
                fr=new FileReader("/home/master/bindingsite.txt");
                br=new BufferedReader(fr);
                String s=" ";
                StringBuffer str=new StringBuffer();
                while((s=br.readLine())!=null){
                    Pattern p= Pattern.compile(">(.*?)<");
                    Matcher m=p.matcher(s);
                    Pattern p1= Pattern.compile("(?<=(about=")).*?(?=")");
                    Matcher m1=p.matcher(s);
                    while(m1.find()){
                        url=m1.group(0);
                        System.out.println(url);
                    }
                    while(m.find()){
                        System.out.println(url+"#"+"	"+m.group(1));
                    }
                }
                
            }catch(Exception e){
                System.out.println(e.getMessage());
            }
            
            
        }
        
        
    
    }
  • 相关阅读:
    2017中国大学生程序设计竞赛
    HDU 1426 Sudoku Killer【DFS 数独】
    Silver Cow Party---poj3268(最短路,迪杰斯特拉)
    Heavy Transportation---poj1797
    Cow Contest---poj3660
    Frogger--poj2253
    最短路基础
    打字母小游戏
    蔡勒(Zeller)公式--黑色星期五
    2的次幂表示
  • 原文地址:https://www.cnblogs.com/Donnnnnn/p/5718535.html
Copyright © 2011-2022 走看看