• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

ajtulloch/LaTeX2Markdown: An AMS-LaTeX compatible converter that maps a subset o ...

原作者: [db:作者] 来自: 网络 收藏 邀请

开源软件名称(OpenSource Name):

ajtulloch/LaTeX2Markdown

开源软件地址(OpenSource Url):

https://github.com/ajtulloch/LaTeX2Markdown

开源编程语言(OpenSource Language):

Python 100.0%

开源软件介绍(OpenSource Introduction):

LaTeX2Markdown

An AMS-LaTeX compatible converter from (a subset of) LaTeX to MathJaX compatible Markdown.

Who should use this?

Anyone who writes LaTeX documents using the AMS-LaTeX packages (amsmath, amsthm, amssymb) and wants to convert these documents to Markdown format to use with MathJaX. These Markdown files can then be easily added to any web platform - Jekyll blogs, Wordpress, basic HTML sites, etc.

In short, if you seek to use MathJaX to view your LaTeX documents online, then you might be interested in this.

Demonstration

Check out tullo.ch/projects/LaTeX2Markdown for a live demonstration of the converter.

Getting Started

Installation

The project is available on PyPI, so getting it is as simple as using

pip install latex2markdown

or

easy_install latex2markdown

Usage

The utility can be called from the command line, or from within a Python script.

For the command line, the syntax to convert a LaTeX file to a Markdown file is as follows:

python -m latex2markdown path/to/latex/file path/to/output/markdown/file

For example, to compile a LaTeX file sample.tex into a Markdown file sample.md, call

python -m latex2markdown sample.tex sample.md

To use it within a Python script (to extend it, modify output, etc.), you can use it as follows:

import latex2markdown
with open("latex_file.tex", "r") as f:
    latex_string = f.read()

l2m = latex2markdown.LaTeX2Markdown(latex_string)

markdown_string = l2m.to_markdown()

with open("markdown_file.md", "w") as f:
    f.write(markdown_string)

Finally, add the following snippet to your HTML when loading this document.

<script type="text/x-mathjax-config">
    MathJax.Hub.Config({
        extensions: ["tex2jax.js", "AMSmath.js"],
        jax: ["input/TeX", "output/HTML-CSS"],
        tex2jax: {
            inlineMath: [ ['$','$'], ["\\(","\\)"] ],
            displayMath: [ ['$$','$$'], ["\[","\]"] ],
            processEscapes: true
        },
    });
</script>
<script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>

For a working example, have a look at the source of the tullo.ch homepage here.

Why not use Pandoc?

Pandoc is an excellent document converter for less complex LaTeX documents. Indeed, I've used it to convert this README document to a reST version for use on PyPI.

Unfortunately, it is not designed to deal with documents that use the AMSTeX extensions - which include the theorem, lemma, proof, and exercise environments that are heavily used for typesetting papers, lecture notes, and other documents.

As neither Pandoc nor MathJaX can deal with these documents, I hacked together a set of regular expressions that can convert a subset of LaTeX to Markdown, and used a few more to convert the sMarkdown to MathJaX-convertible Markdown.

Example

As an example, the following LaTeX code:

\section{Example Section}
\begin{thm}[Euclid]
    There are infinitely many primes.
\end{thm}

\begin{proof}
    Suppose that $p_1 < p_2 < \dots < p_n$ are all of the primes. 
    Let $P = 1 + \prod_{i=1}^n p_i$ and let $p$ be a prime dividing $P$.
    
    Then $p$ can not be any of $p_i$, for otherwise $p$ would divide the 
    difference $P - \left(\prod_{i=1}^n p_i \right) - 1$, which is impossible. 
    So this prime $p$ is still another prime, and $p_1, p_2, \dots p_n$ 
    cannot be all of the primes.
\end{proof}

is converted into the following Markdown:

###  Example Section
#### Theorem 1 (Euclid)

> There are infinitely many primes.

#### Proof

Suppose that $p_1 < p_2 < \dots < p_n$ are all of the primes. 
Let $P = 1 + \prod_{i=1}^n p_i$ and let $p$ be a prime dividing $P$.

Then $p$ can not be any of $p_i$, for otherwise $p$ would divide the difference 
$P - \left(\prod_{i=1}^n p_i \right) - 1$, which is impossible. So this prime 
$p$ is still another prime, and $p_1, p_2, \dots p_n$ cannot be all of the primes.

Supported LaTeX/AMSTeX Environments

  • emph, textbf, texttt
  • thm
  • prop
  • lem
  • exer
  • proof
  • chapter
  • section
  • subsection
  • itemize
  • enumerate

along with everything supported by MathJax - list available online.

Bitdeli Badge




鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap